Base | Representation |
---|---|
bin | 1001001110110011111011… |
… | …00111110010001100010101 |
3 | 2122212200011110212200222222 |
4 | 10213121331213302030111 |
5 | 10130044122443201401 |
6 | 111101425304032125 |
7 | 4163430654433256 |
oct | 447317547621425 |
9 | 78780143780888 |
10 | 20300123022101 |
11 | 651726324a69a |
12 | 233a372162645 |
13 | b433a7756c90 |
14 | 502761864b2d |
15 | 2530bd245c1b |
hex | 12767d9f2315 |
20300123022101 has 64 divisors (see below), whose sum is σ = 24853738291200. Its totient is φ = 16376766852096.
The previous prime is 20300123022043. The next prime is 20300123022107. The reversal of 20300123022101 is 10122032100302.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20300123022101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 20300123022101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20300123022107) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 44032340 + ... + 44490978.
It is an arithmetic number, because the mean of its divisors is an integer number (388339660800).
Almost surely, 220300123022101 is an apocalyptic number.
It is an amenable number.
20300123022101 is a deficient number, since it is larger than the sum of its proper divisors (4553615269099).
20300123022101 is a wasteful number, since it uses less digits than its factorization.
20300123022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458898.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 20300123022101 its reverse (10122032100302), we get a palindrome (30422155122403).
The spelling of 20300123022101 in words is "twenty trillion, three hundred billion, one hundred twenty-three million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •