Base | Representation |
---|---|
bin | 1001001100100110111000… |
… | …1101101100110101001011 |
3 | 1022210201100202021111120022 |
4 | 2103021232031230311023 |
5 | 2311134242214200133 |
6 | 33301252001251055 |
7 | 2062403536431431 |
oct | 223115615546513 |
9 | 38721322244508 |
10 | 10112202100043 |
11 | 324961950851a |
12 | 1173990033a8b |
13 | 5847659408b4 |
14 | 26d60c978d51 |
15 | 12809551e998 |
hex | 9326e36cd4b |
10112202100043 has 2 divisors, whose sum is σ = 10112202100044. Its totient is φ = 10112202100042.
The previous prime is 10112202100009. The next prime is 10112202100111. The reversal of 10112202100043 is 34000120221101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10112202100043 - 240 = 9012690472267 is a prime.
It is a super-2 number, since 2×101122021000432 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10112202099994 and 10112202100030.
It is not a weakly prime, because it can be changed into another prime (10112202102043) 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, 5056101050021 + 5056101050022.
It is an arithmetic number, because the mean of its divisors is an integer number (5056101050022).
Almost surely, 210112202100043 is an apocalyptic number.
10112202100043 is a deficient number, since it is larger than the sum of its proper divisors (1).
10112202100043 is an equidigital number, since it uses as much as digits as its factorization.
10112202100043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 10112202100043 its reverse (34000120221101), we get a palindrome (44112322321144).
The spelling of 10112202100043 in words is "ten trillion, one hundred twelve billion, two hundred two million, one hundred thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •