Base | Representation |
---|---|
bin | 1001010001110101110111… |
… | …1010110000000010101111 |
3 | 1100010022110111100000212001 |
4 | 2110131131322300002233 |
5 | 2314122421442311343 |
6 | 33410442434353131 |
7 | 2102036055522424 |
oct | 224353572600257 |
9 | 40108414300761 |
10 | 10202123010223 |
11 | 328377251a221 |
12 | 11892a642b7a7 |
13 | 590096260b61 |
14 | 273add169d4b |
15 | 12a5a997744d |
hex | 9475deb00af |
10202123010223 has 2 divisors, whose sum is σ = 10202123010224. Its totient is φ = 10202123010222.
The previous prime is 10202123010221. The next prime is 10202123010227. The reversal of 10202123010223 is 32201032120201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10202123010223 - 21 = 10202123010221 is a prime.
Together with 10202123010221, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 10202123010223.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10202123010221) 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, 5101061505111 + 5101061505112.
It is an arithmetic number, because the mean of its divisors is an integer number (5101061505112).
Almost surely, 210202123010223 is an apocalyptic number.
10202123010223 is a deficient number, since it is larger than the sum of its proper divisors (1).
10202123010223 is an equidigital number, since it uses as much as digits as its factorization.
10202123010223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 10202123010223 its reverse (32201032120201), we get a palindrome (42403155130424).
The spelling of 10202123010223 in words is "ten trillion, two hundred two billion, one hundred twenty-three million, ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •