Base | Representation |
---|---|
bin | 10111001100011100001111… |
… | …001000110011001000011011 |
3 | 111101012001200211201111200101 |
4 | 113030130033020303020123 |
5 | 101332313011141241443 |
6 | 1000542431322320231 |
7 | 30325660306063534 |
oct | 2714341710631033 |
9 | 441161624644611 |
10 | 102010022212123 |
11 | 2a55a2311632a3 |
12 | b536286059077 |
13 | 44bc671b73a3c |
14 | 1b2945076768b |
15 | bbd7ac59684d |
hex | 5cc70f23321b |
102010022212123 has 2 divisors, whose sum is σ = 102010022212124. Its totient is φ = 102010022212122.
The previous prime is 102010022212093. The next prime is 102010022212247. The reversal of 102010022212123 is 321212220010201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102010022212123 - 29 = 102010022211611 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102010022212123.
It is not a weakly prime, because it can be changed into another prime (102010022312123) 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, 51005011106061 + 51005011106062.
It is an arithmetic number, because the mean of its divisors is an integer number (51005011106062).
Almost surely, 2102010022212123 is an apocalyptic number.
102010022212123 is a deficient number, since it is larger than the sum of its proper divisors (1).
102010022212123 is an equidigital number, since it uses as much as digits as its factorization.
102010022212123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 102010022212123 its reverse (321212220010201), we get a palindrome (423222242222324).
The spelling of 102010022212123 in words is "one hundred two trillion, ten billion, twenty-two million, two hundred twelve thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •