Base | Representation |
---|---|
bin | 10110110000111100000111… |
… | …000000001000011101010011 |
3 | 111010111101110220212100220211 |
4 | 112300330013000020131103 |
5 | 101110331431112042321 |
6 | 552534312232544551 |
7 | 30042303262225054 |
oct | 2660740700103523 |
9 | 433441426770824 |
10 | 100120100112211 |
11 | 299a077242a063 |
12 | b28bb42b52157 |
13 | 43b3391cb2bba |
14 | 1aa1ba557872b |
15 | b8954844d0e1 |
hex | 5b0f07008753 |
100120100112211 has 8 divisors (see below), whose sum is σ = 103350771375104. Its totient is φ = 96889490762760.
The previous prime is 100120100112191. The next prime is 100120100112233. The reversal of 100120100112211 is 112211001021001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-100120100112211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100120100112191 and 100120100112200.
It is not an unprimeable number, because it can be changed into a prime (100120100112281) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12180831 + ... + 18671176.
It is an arithmetic number, because the mean of its divisors is an integer number (12918846421888).
Almost surely, 2100120100112211 is an apocalyptic number.
100120100112211 is a deficient number, since it is larger than the sum of its proper divisors (3230671262893).
100120100112211 is a wasteful number, since it uses less digits than its factorization.
100120100112211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30956721.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100120100112211 its reverse (112211001021001), we get a palindrome (212331101133212).
The spelling of 100120100112211 in words is "one hundred trillion, one hundred twenty billion, one hundred million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •