Base | Representation |
---|---|
bin | 1001100011010001101111… |
… | …00100001001011011011001 |
3 | 2202100220020122101021010102 |
4 | 10301220313210021123121 |
5 | 10223104301002100441 |
6 | 112400443145025145 |
7 | 4265303622612050 |
oct | 461506744113331 |
9 | 82326218337112 |
10 | 21003322300121 |
11 | 6768505979207 |
12 | 24327021851b5 |
13 | b947b296bc25 |
14 | 5287cda07397 |
15 | 26652810769b |
hex | 131a379096d9 |
21003322300121 has 16 divisors (see below), whose sum is σ = 24058033359360. Its totient is φ = 17962177394880.
The previous prime is 21003322300109. The next prime is 21003322300201. The reversal of 21003322300121 is 12100322330012.
It is a cyclic number.
It is not a de Polignac number, because 21003322300121 - 214 = 21003322283737 is a prime.
It is a super-2 number, since 2×210033223001212 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21003322300093 and 21003322300102.
It is not an unprimeable number, because it can be changed into a prime (21003322300721) 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, 36232400 + ... + 36807518.
It is an arithmetic number, because the mean of its divisors is an integer number (1503627084960).
Almost surely, 221003322300121 is an apocalyptic number.
It is an amenable number.
21003322300121 is a deficient number, since it is larger than the sum of its proper divisors (3054711059239).
21003322300121 is a wasteful number, since it uses less digits than its factorization.
21003322300121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 586904.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 21003322300121 its reverse (12100322330012), we get a palindrome (33103644630133).
The spelling of 21003322300121 in words is "twenty-one trillion, three billion, three hundred twenty-two million, three hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •