Base | Representation |
---|---|
bin | 1010111011001001001101… |
… | …1000011111010011001100 |
3 | 1120112021000021011112201212 |
4 | 2232302103120133103030 |
5 | 3033242420003330103 |
6 | 41313511503153552 |
7 | 2346531522624560 |
oct | 256622330372314 |
9 | 46467007145655 |
10 | 12011201230028 |
11 | 3910a15a65800 |
12 | 141ba26ba58b8 |
13 | 691861212350 |
14 | 2d74b94b16a0 |
15 | 15c68b4ad7d8 |
hex | aec9361f4cc |
12011201230028 has 144 divisors (see below), whose sum is σ = 29672274293760. Its totient is φ = 4131898784640.
The previous prime is 12011201229967. The next prime is 12011201230033. The reversal of 12011201230028 is 82003210211021.
It is a super-2 number, since 2×120112012300282 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a junction number, because it is equal to n+sod(n) for n = 12011201229985 and 12011201230012.
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 47 ways as a sum of consecutive naturals, for example, 4915448 + ... + 6941471.
Almost surely, 212011201230028 is an apocalyptic number.
It is an amenable number.
12011201230028 is an abundant number, since it is smaller than the sum of its proper divisors (17661073063732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12011201230028 is a wasteful number, since it uses less digits than its factorization.
12011201230028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11856988 (or 11856975 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 12011201230028 its reverse (82003210211021), we get a palindrome (94014411441049).
The spelling of 12011201230028 in words is "twelve trillion, eleven billion, two hundred one million, two hundred thirty thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •