Base | Representation |
---|---|
bin | 10110101111010111011100… |
… | …011100101111111000000010 |
3 | 111010010001111002000220122101 |
4 | 112233113130130233320002 |
5 | 101102044100033323020 |
6 | 552412514541501014 |
7 | 30031425614432431 |
oct | 2657273434577002 |
9 | 433101432026571 |
10 | 100012012011010 |
11 | 29959946521900 |
12 | b272bb857176a |
13 | 43a6127924778 |
14 | 1a9a870279118 |
15 | b8681e11400a |
hex | 5af5dc72fe02 |
100012012011010 has 48 divisors (see below), whose sum is σ = 197957083113216. Its totient is φ = 36352919108000.
The previous prime is 100012012010983. The next prime is 100012012011011. The reversal of 100012012011010 is 10110210210001.
It is a super-2 number, since 2×1000120120110102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (100012012011011) 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, 14223826 + ... + 20058445.
It is an arithmetic number, because the mean of its divisors is an integer number (4124105898192).
Almost surely, 2100012012011010 is an apocalyptic number.
100012012011010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100012012011010 is a deficient number, since it is larger than the sum of its proper divisors (97945071102206).
100012012011010 is a wasteful number, since it uses less digits than its factorization.
100012012011010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34284711 (or 34284700 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 100012012011010 its reverse (10110210210001), we get a palindrome (110122222221011).
The spelling of 100012012011010 in words is "one hundred trillion, twelve billion, twelve million, eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •