Base | Representation |
---|---|
bin | 1001100011110001000001… |
… | …10110111010010100101001 |
3 | 2202102111121101111102021022 |
4 | 10301320200312322110221 |
5 | 10223343202012242301 |
6 | 112412302124022225 |
7 | 4266440125165106 |
oct | 461704066722451 |
9 | 82374541442238 |
10 | 21020121212201 |
11 | 6774646481521 |
12 | 2435a10091975 |
13 | b9625c0b6aa7 |
14 | 529544addaad |
15 | 266bacd0cd1b |
hex | 131e20dba529 |
21020121212201 has 8 divisors (see below), whose sum is σ = 21111905784960. Its totient is φ = 20928368592208.
The previous prime is 21020121212183. The next prime is 21020121212203. The reversal of 21020121212201 is 10221212102012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21020121212201 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21020121212201.
It is not an unprimeable number, because it can be changed into a prime (21020121212203) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6669146 + ... + 9301491.
It is an arithmetic number, because the mean of its divisors is an integer number (2638988223120).
Almost surely, 221020121212201 is an apocalyptic number.
It is an amenable number.
21020121212201 is a deficient number, since it is larger than the sum of its proper divisors (91784572759).
21020121212201 is a wasteful number, since it uses less digits than its factorization.
21020121212201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15976383.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 21020121212201 its reverse (10221212102012), we get a palindrome (31241333314213).
The spelling of 21020121212201 in words is "twenty-one trillion, twenty billion, one hundred twenty-one million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •