Base | Representation |
---|---|
bin | 1001101001101001000110… |
… | …00001011111001100011011 |
3 | 2210010210202010120102110021 |
4 | 10310310203001133030123 |
5 | 10240200144334031021 |
6 | 113045132321131311 |
7 | 4320145315114654 |
oct | 464644301371433 |
9 | 83123663512407 |
10 | 21222021002011 |
11 | 6842232664945 |
12 | 2468b77a89b37 |
13 | bac2c6b94c3b |
14 | 53521923252b |
15 | 26c077e4cc41 |
hex | 134d2305f31b |
21222021002011 has 8 divisors (see below), whose sum is σ = 21252391255040. Its totient is φ = 21191661877032.
The previous prime is 21222021001967. The next prime is 21222021002033. The reversal of 21222021002011 is 11020012022212.
It is a happy number.
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-21222021002011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21222021102011) 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, 1038616 + ... + 6597178.
It is an arithmetic number, because the mean of its divisors is an integer number (2656548906880).
Almost surely, 221222021002011 is an apocalyptic number.
21222021002011 is a deficient number, since it is larger than the sum of its proper divisors (30370253029).
21222021002011 is an equidigital number, since it uses as much as digits as its factorization.
21222021002011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5564025.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 21222021002011 its reverse (11020012022212), we get a palindrome (32242033024223).
It can be divided in two parts, 2122202 and 1002011, that added together give a palindrome (3124213).
The spelling of 21222021002011 in words is "twenty-one trillion, two hundred twenty-two billion, twenty-one million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •