Base | Representation |
---|---|
bin | 10100110110100101010010 |
3 | 101021201120010 |
4 | 110312211102 |
5 | 2344411300 |
6 | 313055350 |
7 | 64315113 |
oct | 24664522 |
9 | 11251503 |
10 | 5466450 |
11 | 30a4030 |
12 | 19b7556 |
13 | 11951b2 |
14 | a2420a |
15 | 72ea50 |
hex | 536952 |
5466450 has 48 divisors (see below), whose sum is σ = 14793696. Its totient is φ = 1324800.
The previous prime is 5466449. The next prime is 5466497. The reversal of 5466450 is 546645.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7 + ... + 3306.
It is an arithmetic number, because the mean of its divisors is an integer number (308202).
Almost surely, 25466450 is an apocalyptic number.
5466450 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 5466450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7396848).
5466450 is an abundant number, since it is smaller than the sum of its proper divisors (9327246).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5466450 is a wasteful number, since it uses less digits than its factorization.
5466450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3339 (or 3334 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
The square root of 5466450 is about 2338.0440543326. The cubic root of 5466450 is about 176.1577657341.
It can be divided in two parts, 546 and 6450, that added together give a palindrome (6996).
The spelling of 5466450 in words is "five million, four hundred sixty-six thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •