Base | Representation |
---|---|
bin | 1010111010011111110110… |
… | …1100101010010011101000 |
3 | 1120111012100121020200101012 |
4 | 2232213331230222103220 |
5 | 3033102201100013000 |
6 | 41304434141243052 |
7 | 2345656444010426 |
oct | 256477554522350 |
9 | 46435317220335 |
10 | 12000100001000 |
11 | 3907239677061 |
12 | 1419849263488 |
13 | 6907b2333987 |
14 | 2d6b44db0116 |
15 | 15c23bac5735 |
hex | ae9fdb2a4e8 |
12000100001000 has 32 divisors (see below), whose sum is σ = 28080234004680. Its totient is φ = 4800040000000.
The previous prime is 12000100000943. The next prime is 12000100001017. The reversal of 12000100001000 is 10000100021.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 3527191998724 + 8472908002276 = 1878082^2 + 2910826^2 .
It is a Harshad number since it is a multiple of its sum of digits (5).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6000049001 + ... + 6000051000.
Almost surely, 212000100001000 is an apocalyptic number.
12000100001000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12000100001000 is an abundant number, since it is smaller than the sum of its proper divisors (16080134003680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12000100001000 is a wasteful number, since it uses less digits than its factorization.
12000100001000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12000100022 (or 12000100008 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 5.
Adding to 12000100001000 its reverse (10000100021), we get a palindrome (12010100101021).
The spelling of 12000100001000 in words is "twelve trillion, one hundred million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •