Base | Representation |
---|---|
bin | 110010011000101111… |
… | …100010100000110000 |
3 | 12011122110211212001101 |
4 | 302120233202200300 |
5 | 1341300131102022 |
6 | 40504302014144 |
7 | 3623463111334 |
oct | 623057424060 |
9 | 164573755041 |
10 | 54102206512 |
11 | 20a43315572 |
12 | a59a877354 |
13 | 51428c8363 |
14 | 289348b7c4 |
15 | 1619aa8627 |
hex | c98be2830 |
54102206512 has 80 divisors (see below), whose sum is σ = 115024959360. Its totient is φ = 24537268224.
The previous prime is 54102206491. The next prime is 54102206513. The reversal of 54102206512 is 21560220145.
It is a super-2 number, since 2×541022065122 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (54102206513) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4545433 + ... + 4557319.
It is an arithmetic number, because the mean of its divisors is an integer number (1437811992).
Almost surely, 254102206512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 54102206512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57512479680).
54102206512 is an abundant number, since it is smaller than the sum of its proper divisors (60922752848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54102206512 is a wasteful number, since it uses less digits than its factorization.
54102206512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12518 (or 12512 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 54102206512 its reverse (21560220145), we get a palindrome (75662426657).
The spelling of 54102206512 in words is "fifty-four billion, one hundred two million, two hundred six thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •