Base | Representation |
---|---|
bin | 1111111001000111111… |
… | …10001111011101011000 |
3 | 1221012111011102221010221 |
4 | 13330203332033131120 |
5 | 32421314434143100 |
6 | 1054505234245424 |
7 | 54310661343631 |
oct | 7744376173530 |
9 | 1835434387127 |
10 | 546064365400 |
11 | 1a0648109a74 |
12 | 899b7a26874 |
13 | 3c655714018 |
14 | 1c602d96888 |
15 | e30ec1901a |
hex | 7f23f8f758 |
546064365400 has 96 divisors (see below), whose sum is σ = 1290289603680. Its totient is φ = 214879616000.
The previous prime is 546064365397. The next prime is 546064365401. The reversal of 546064365400 is 4563460645.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (546064365401) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6504492 + ... + 6587908.
It is an arithmetic number, because the mean of its divisors is an integer number (13440516705).
Almost surely, 2546064365400 is an apocalyptic number.
546064365400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 546064365400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (645144801840).
546064365400 is an abundant number, since it is smaller than the sum of its proper divisors (744225238280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
546064365400 is a wasteful number, since it uses less digits than its factorization.
546064365400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83965 (or 83956 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 43.
The spelling of 546064365400 in words is "five hundred forty-six billion, sixty-four million, three hundred sixty-five thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •