Base | Representation |
---|---|
bin | 1001101001010011000100… |
… | …11111110000110100000100 |
3 | 2210002200020101011011121012 |
4 | 10310221202133300310010 |
5 | 10240001442424014340 |
6 | 113035455401341352 |
7 | 4316246360554160 |
oct | 464514237606404 |
9 | 83080211134535 |
10 | 21210201001220 |
11 | 6838217575350 |
12 | 2466819497858 |
13 | bab162103b2a |
14 | 5348174abca0 |
15 | 26bad53d5565 |
hex | 134a627f0d04 |
21210201001220 has 96 divisors (see below), whose sum is σ = 55535529885696. Its totient is φ = 6610570876800.
The previous prime is 21210201001133. The next prime is 21210201001309. The reversal of 21210201001220 is 2210010201212.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 21210201001195 and 21210201001204.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25510589 + ... + 26328891.
It is an arithmetic number, because the mean of its divisors is an integer number (578495102976).
Almost surely, 221210201001220 is an apocalyptic number.
21210201001220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21210201001220 is an abundant number, since it is smaller than the sum of its proper divisors (34325328884476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21210201001220 is a wasteful number, since it uses less digits than its factorization.
21210201001220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 835161 (or 835159 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 21210201001220 its reverse (2210010201212), we get a palindrome (23420211202432).
The spelling of 21210201001220 in words is "twenty-one trillion, two hundred ten billion, two hundred one million, one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •