Base | Representation |
---|---|
bin | 1001010001110101110100… |
… | …1001100000001010011011 |
3 | 1100010022102121001010112012 |
4 | 2110131131021200022123 |
5 | 2314122410141200443 |
6 | 33410441253540135 |
7 | 2102035541012564 |
oct | 224353511401233 |
9 | 40108377033465 |
10 | 10202110100123 |
11 | 3283766201717 |
12 | 11892a204464b |
13 | 590093690846 |
14 | 273adb56916b |
15 | 12a5a8777118 |
hex | 9475d26029b |
10202110100123 has 2 divisors, whose sum is σ = 10202110100124. Its totient is φ = 10202110100122.
The previous prime is 10202110100093. The next prime is 10202110100131. The reversal of 10202110100123 is 32100101120201.
It is a strong prime.
It is an emirp because it is prime and its reverse (32100101120201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10202110100123 - 216 = 10202110034587 is a prime.
It is a super-3 number, since 3×102021101001233 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10202110100098 and 10202110100107.
It is not a weakly prime, because it can be changed into another prime (10202110100023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5101055050061 + 5101055050062.
It is an arithmetic number, because the mean of its divisors is an integer number (5101055050062).
Almost surely, 210202110100123 is an apocalyptic number.
10202110100123 is a deficient number, since it is larger than the sum of its proper divisors (1).
10202110100123 is an equidigital number, since it uses as much as digits as its factorization.
10202110100123 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 10202110100123 its reverse (32100101120201), we get a palindrome (42302211220324).
The spelling of 10202110100123 in words is "ten trillion, two hundred two billion, one hundred ten million, one hundred thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •