Base | Representation |
---|---|
bin | 1001010001110101011111… |
… | …0110000010100100111011 |
3 | 1100010022012101121001221100 |
4 | 2110131113312002210323 |
5 | 2314122214401041443 |
6 | 33410424354342443 |
7 | 2102033410433421 |
oct | 224352766024473 |
9 | 40108171531840 |
10 | 10202021112123 |
11 | 328371aa51715 |
12 | 118927828aa23 |
13 | 59007b104419 |
14 | 273acd803111 |
15 | 12a5a0a4a3d3 |
hex | 94757d8293b |
10202021112123 has 12 divisors (see below), whose sum is σ = 14736280749840. Its totient is φ = 6801334470096.
The previous prime is 10202021112113. The next prime is 10202021112149. The reversal of 10202021112123 is 32121112020201.
It is not a de Polignac number, because 10202021112123 - 213 = 10202021103931 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10202021112096 and 10202021112105.
It is not an unprimeable number, because it can be changed into a prime (10202021112113) 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 in 11 ways as a sum of consecutive naturals, for example, 7549858 + ... + 8797976.
It is an arithmetic number, because the mean of its divisors is an integer number (1228023395820).
Almost surely, 210202021112123 is an apocalyptic number.
10202021112123 is a deficient number, since it is larger than the sum of its proper divisors (4534259637717).
10202021112123 is a wasteful number, since it uses less digits than its factorization.
10202021112123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2156338 (or 2156335 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 10202021112123 its reverse (32121112020201), we get a palindrome (42323133132324).
The spelling of 10202021112123 in words is "ten trillion, two hundred two billion, twenty-one million, one hundred twelve thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •