Base | Representation |
---|---|
bin | 1001000110101100001101… |
… | …00111101101001001001001 |
3 | 2121212222221221221120111021 |
4 | 10203112012213231021021 |
5 | 10111011203341401441 |
6 | 110325322240232441 |
7 | 4134322356424231 |
oct | 443260647551111 |
9 | 77788857846437 |
10 | 20021101122121 |
11 | 64199a06a8440 |
12 | 22b428230b721 |
13 | b22c9bb43008 |
14 | 4d3052894cc1 |
15 | 24abdc60a3d1 |
hex | 1235869ed249 |
20021101122121 has 16 divisors (see below), whose sum is σ = 23126166906048. Its totient is φ = 17130213798400.
The previous prime is 20021101122107. The next prime is 20021101122287. The reversal of 20021101122121 is 12122110112002.
It is not a de Polignac number, because 20021101122121 - 27 = 20021101121993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20021101122095 and 20021101122104.
It is not an unprimeable number, because it can be changed into a prime (20021101132121) 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, 27109866 + ... + 27838588.
It is an arithmetic number, because the mean of its divisors is an integer number (1445385431628).
Almost surely, 220021101122121 is an apocalyptic number.
It is an amenable number.
20021101122121 is a deficient number, since it is larger than the sum of its proper divisors (3105065783927).
20021101122121 is a wasteful number, since it uses less digits than its factorization.
20021101122121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 875672.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20021101122121 its reverse (12122110112002), we get a palindrome (32143211234123).
The spelling of 20021101122121 in words is "twenty trillion, twenty-one billion, one hundred one million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •