Base | Representation |
---|---|
bin | 1001001101000101000110… |
… | …0111010110100111001111 |
3 | 1022211111021221220021210122 |
4 | 2103101101213112213033 |
5 | 2311302344412020421 |
6 | 33305112433255155 |
7 | 2063111525343362 |
oct | 223212147264717 |
9 | 38744257807718 |
10 | 10120312220111 |
11 | 3252000459795 |
12 | 11754741044bb |
13 | 585458c2b902 |
14 | 26db7bb0a0d9 |
15 | 1283bc51d2ab |
hex | 934519d69cf |
10120312220111 has 2 divisors, whose sum is σ = 10120312220112. Its totient is φ = 10120312220110.
The previous prime is 10120312220093. The next prime is 10120312220131. The reversal of 10120312220111 is 11102221302101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10120312220111 - 230 = 10119238478287 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10120312220111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10120312220131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060156110055 + 5060156110056.
It is an arithmetic number, because the mean of its divisors is an integer number (5060156110056).
Almost surely, 210120312220111 is an apocalyptic number.
10120312220111 is a deficient number, since it is larger than the sum of its proper divisors (1).
10120312220111 is an equidigital number, since it uses as much as digits as its factorization.
10120312220111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 10120312220111 its reverse (11102221302101), we get a palindrome (21222533522212).
The spelling of 10120312220111 in words is "ten trillion, one hundred twenty billion, three hundred twelve million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •