Base | Representation |
---|---|
bin | 10110110000111100000001… |
… | …000110011110010001000111 |
3 | 111010111101020000120120221102 |
4 | 112300330001012132101013 |
5 | 101110331230241023421 |
6 | 552534254335010315 |
7 | 30042300650563112 |
oct | 2660740106362107 |
9 | 433441200516842 |
10 | 100120001111111 |
11 | 299a0721560073 |
12 | b28bb1596999b |
13 | 43b337762bc77 |
14 | 1aa1b96367579 |
15 | b8953e8e460b |
hex | 5b0f0119e447 |
100120001111111 has 2 divisors, whose sum is σ = 100120001111112. Its totient is φ = 100120001111110.
The previous prime is 100120001110951. The next prime is 100120001111197. The reversal of 100120001111111 is 111111100021001.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100120001111111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100120001111092 and 100120001111101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100120001110111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50060000555555 + 50060000555556.
It is an arithmetic number, because the mean of its divisors is an integer number (50060000555556).
Almost surely, 2100120001111111 is an apocalyptic number.
100120001111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
100120001111111 is an equidigital number, since it uses as much as digits as its factorization.
100120001111111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 100120001111111 its reverse (111111100021001), we get a palindrome (211231101132112).
The spelling of 100120001111111 in words is "one hundred trillion, one hundred twenty billion, one million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •