Base | Representation |
---|---|
bin | 1001001101000111101101… |
… | …0101100100010111100101 |
3 | 1022211120002202000222222021 |
4 | 2103101323111210113211 |
5 | 2311310313110412213 |
6 | 33305310120303141 |
7 | 2063135055154654 |
oct | 223217325442745 |
9 | 38746082028867 |
10 | 10121012200933 |
11 | 325232a595737 |
12 | 117562a611ab1 |
13 | 58553ac6234a |
14 | 26dc06a7b19b |
15 | 12840dbd9d8d |
hex | 9347b5645e5 |
10121012200933 has 2 divisors, whose sum is σ = 10121012200934. Its totient is φ = 10121012200932.
The previous prime is 10121012200877. The next prime is 10121012201017. The reversal of 10121012200933 is 33900221012101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9882962863524 + 238049337409 = 3143718^2 + 487903^2 .
It is a cyclic number.
It is not a de Polignac number, because 10121012200933 - 29 = 10121012200421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10121012200898 and 10121012200907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10121012201933) 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, 5060506100466 + 5060506100467.
It is an arithmetic number, because the mean of its divisors is an integer number (5060506100467).
Almost surely, 210121012200933 is an apocalyptic number.
It is an amenable number.
10121012200933 is a deficient number, since it is larger than the sum of its proper divisors (1).
10121012200933 is an equidigital number, since it uses as much as digits as its factorization.
10121012200933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 25.
The spelling of 10121012200933 in words is "ten trillion, one hundred twenty-one billion, twelve million, two hundred thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •