Base | Representation |
---|---|
bin | 1001010001101110010101… |
… | …1001011001001101010111 |
3 | 1100010010020120120021022101 |
4 | 2110123211121121031113 |
5 | 2314104301324000043 |
6 | 33405510043542531 |
7 | 2101635003650104 |
oct | 224334531311527 |
9 | 40103216507271 |
10 | 10200101000023 |
11 | 328292510a010 |
12 | 1188a2122aa47 |
13 | 58cb3337b40c |
14 | 27398a7c1aab |
15 | 12a4dc1b824d |
hex | 946e5659357 |
10200101000023 has 16 divisors (see below), whose sum is σ = 11316171513600. Its totient is φ = 9115500502080.
The previous prime is 10200100999993. The next prime is 10200101000041. The reversal of 10200101000023 is 32000010100201.
It is a cyclic number.
It is not a de Polignac number, because 10200101000023 - 221 = 10200098902871 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10200100999973 and 10200101000009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200101000093) 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 15 ways as a sum of consecutive naturals, for example, 59992390 + ... + 60162172.
It is an arithmetic number, because the mean of its divisors is an integer number (707260719600).
Almost surely, 210200101000023 is an apocalyptic number.
10200101000023 is a deficient number, since it is larger than the sum of its proper divisors (1116070513577).
10200101000023 is a wasteful number, since it uses less digits than its factorization.
10200101000023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262422.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 10200101000023 its reverse (32000010100201), we get a palindrome (42200111100224).
The spelling of 10200101000023 in words is "ten trillion, two hundred billion, one hundred one million, twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •