Base | Representation |
---|---|
bin | 10110110000111100000111… |
… | …100101110110110000111011 |
3 | 111010111101111121110210002002 |
4 | 112300330013211312300323 |
5 | 101110331441130014321 |
6 | 552534313224531215 |
7 | 30042303442253006 |
oct | 2660740745666073 |
9 | 433441447423062 |
10 | 100120110001211 |
11 | 299a0777a73893 |
12 | b28bb46320b0b |
13 | 43b3394066091 |
14 | 1aa1ba69d053d |
15 | b8954925320b |
hex | 5b0f07976c3b |
100120110001211 has 8 divisors (see below), whose sum is σ = 103839600411648. Its totient is φ = 96431232681000.
The previous prime is 100120110001199. The next prime is 100120110001253. The reversal of 100120110001211 is 112100011021001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100120110001211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100120110001192 and 100120110001201.
It is not an unprimeable number, because it can be changed into a prime (100120110001271) 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, 7653265895 + ... + 7653278976.
It is an arithmetic number, because the mean of its divisors is an integer number (12979950051456).
Almost surely, 2100120110001211 is an apocalyptic number.
100120110001211 is a deficient number, since it is larger than the sum of its proper divisors (3719490410437).
100120110001211 is a wasteful number, since it uses less digits than its factorization.
100120110001211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15306545113.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100120110001211 its reverse (112100011021001), we get a palindrome (212220121022212).
The spelling of 100120110001211 in words is "one hundred trillion, one hundred twenty billion, one hundred ten million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •