Base | Representation |
---|---|
bin | 10111100011011011… |
… | …11111011101010110 |
3 | 1012122021100210121110 |
4 | 23301231333131112 |
5 | 201344144100204 |
6 | 5450440355450 |
7 | 625235164002 |
oct | 136155773526 |
9 | 35567323543 |
10 | 12645300054 |
11 | 53a9a40102 |
12 | 254aa75b86 |
13 | 1266a6148a |
14 | 87d5d7702 |
15 | 4e023a889 |
hex | 2f1b7f756 |
12645300054 has 8 divisors (see below), whose sum is σ = 25290600120. Its totient is φ = 4215100016.
The previous prime is 12645300029. The next prime is 12645300113. The reversal of 12645300054 is 45000354621.
It is a sphenic number, since it is the product of 3 distinct primes.
12645300054 is an admirable number.
It is a super-2 number, since 2×126453000542 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12645299994 and 12645300030.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1053774999 + ... + 1053775010.
It is an arithmetic number, because the mean of its divisors is an integer number (3161325015).
Almost surely, 212645300054 is an apocalyptic number.
12645300054 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12645300054 is a wasteful number, since it uses less digits than its factorization.
12645300054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2107550014.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 12645300054 its reverse (45000354621), we get a palindrome (57645654675).
The spelling of 12645300054 in words is "twelve billion, six hundred forty-five million, three hundred thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •