Base | Representation |
---|---|
bin | 1001100011110100100001… |
… | …11010100100111010110110 |
3 | 2202102200110102001202221000 |
4 | 10301322100322210322312 |
5 | 10223411024303040202 |
6 | 112413212443104130 |
7 | 4266534534044154 |
oct | 461722072447266 |
9 | 82380412052830 |
10 | 21022001221302 |
11 | 6775420713154 |
12 | 2436255812046 |
13 | b9649b73b403 |
14 | 5296826823d4 |
15 | 266c6cdbc91c |
hex | 131e90ea4eb6 |
21022001221302 has 32 divisors (see below), whose sum is σ = 48326439592800. Its totient is φ = 6765701541984.
The previous prime is 21022001221259. The next prime is 21022001221349. The reversal of 21022001221302 is 20312210022012.
21022001221302 is a `hidden beast` number, since 21 + 0 + 220 + 0 + 122 + 1 + 302 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6712003933 + ... + 6712007064.
It is an arithmetic number, because the mean of its divisors is an integer number (1510201237275).
Almost surely, 221022001221302 is an apocalyptic number.
21022001221302 is an abundant number, since it is smaller than the sum of its proper divisors (27304438371498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21022001221302 is a wasteful number, since it uses less digits than its factorization.
21022001221302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13424011037 (or 13424011031 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 21022001221302 its reverse (20312210022012), we get a palindrome (41334211243314).
The spelling of 21022001221302 in words is "twenty-one trillion, twenty-two billion, one million, two hundred twenty-one thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •