Base | Representation |
---|---|
bin | 1001101001100101101101… |
… | …00110100101110101100100 |
3 | 2210010122001100211011021000 |
4 | 10310302312212211311210 |
5 | 10240132433203341004 |
6 | 113044232021553300 |
7 | 4320052250006052 |
oct | 464626646456544 |
9 | 83118040734230 |
10 | 21220202012004 |
11 | 684148990a816 |
12 | 246874a875830 |
13 | bac0970863a8 |
14 | 5350c58151d2 |
15 | 26bebd3e2c39 |
hex | 134cb69a5d64 |
21220202012004 has 48 divisors (see below), whose sum is σ = 55529500622400. Its totient is φ = 7007294118528.
The previous prime is 21220202011997. The next prime is 21220202012033. The reversal of 21220202012004 is 40021020202212.
21220202012004 is a `hidden beast` number, since 21 + 220 + 20 + 201 + 200 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
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, 918134949 + ... + 918158060.
It is an arithmetic number, because the mean of its divisors is an integer number (1156864596300).
Almost surely, 221220202012004 is an apocalyptic number.
It is an amenable number.
21220202012004 is an abundant number, since it is smaller than the sum of its proper divisors (34309298610396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21220202012004 is a wasteful number, since it uses less digits than its factorization.
21220202012004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1836293129 (or 1836293121 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 21220202012004 its reverse (40021020202212), we get a palindrome (61241222214216).
The spelling of 21220202012004 in words is "twenty-one trillion, two hundred twenty billion, two hundred two million, twelve thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •