Base | Representation |
---|---|
bin | 10110110000110011110100… |
… | …100001010100110110001100 |
3 | 111010110112111122221111211211 |
4 | 112300303310201110312030 |
5 | 101110210214212041022 |
6 | 552530241143024204 |
7 | 30041536602405445 |
oct | 2660636441246614 |
9 | 433415448844754 |
10 | 100111200112012 |
11 | 29997a1562a1a1 |
12 | b28a27a43b064 |
13 | 43b25a41762ab |
14 | 1aa159d5542cc |
15 | b891c6e25e77 |
hex | 5b0cf4854d8c |
100111200112012 has 48 divisors (see below), whose sum is σ = 186734577935808. Its totient is φ = 46797671116800.
The previous prime is 100111200111973. The next prime is 100111200112019. The reversal of 100111200112012 is 210211002111001.
It is a happy number.
It is a super-2 number, since 2×1001112001120122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100111200111983 and 100111200112001.
It is not an unprimeable number, because it can be changed into a prime (100111200112019) 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, 364756738 + ... + 365031094.
It is an arithmetic number, because the mean of its divisors is an integer number (3890303706996).
Almost surely, 2100111200112012 is an apocalyptic number.
It is an amenable number.
100111200112012 is a deficient number, since it is larger than the sum of its proper divisors (86623377823796).
100111200112012 is a wasteful number, since it uses less digits than its factorization.
100111200112012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 310066 (or 310064 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100111200112012 its reverse (210211002111001), we get a palindrome (310322202223013).
The spelling of 100111200112012 in words is "one hundred trillion, one hundred eleven billion, two hundred million, one hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •