Base | Representation |
---|---|
bin | 1001010001101110011010… |
… | …1001111011010000101111 |
3 | 1100010010022001021211011021 |
4 | 2110123212221323100233 |
5 | 2314104322230023043 |
6 | 33405512120235011 |
7 | 2101635351254155 |
oct | 224334651732057 |
9 | 40103261254137 |
10 | 10200122111023 |
11 | 3282936019019 |
12 | 1188a2830ba67 |
13 | 58cb37860430 |
14 | 27398d5193d5 |
15 | 12a4dde883ed |
hex | 946e6a7b42f |
10200122111023 has 16 divisors (see below), whose sum is σ = 11260337830560. Its totient is φ = 9182174943744.
The previous prime is 10200122111009. The next prime is 10200122111029. The reversal of 10200122111023 is 32011122100201.
It is a cyclic number.
It is not a de Polignac number, because 10200122111023 - 25 = 10200122110991 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10200122110988 and 10200122111006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200122111029) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 60299161 + ... + 60468082.
It is an arithmetic number, because the mean of its divisors is an integer number (703771114410).
Almost surely, 210200122111023 is an apocalyptic number.
10200122111023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10200122111023 is a deficient number, since it is larger than the sum of its proper divisors (1060215719537).
10200122111023 is a wasteful number, since it uses less digits than its factorization.
10200122111023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120767418.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 10200122111023 its reverse (32011122100201), we get a palindrome (42211244211224).
The spelling of 10200122111023 in words is "ten trillion, two hundred billion, one hundred twenty-two million, one hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •