Base | Representation |
---|---|
bin | 1001100011001011100100… |
… | …01001001011111100111110 |
3 | 2202100120200210221010120110 |
4 | 10301211302021023330332 |
5 | 10223031010042333042 |
6 | 112355134345330450 |
7 | 4265125553553162 |
oct | 461456211137476 |
9 | 82316623833513 |
10 | 21000010121022 |
11 | 6767066276009 |
12 | 2431b38a96a26 |
13 | b943a56b423a |
14 | 528597b7aca2 |
15 | 2663d244b09c |
hex | 13197224bf3e |
21000010121022 has 8 divisors (see below), whose sum is σ = 42000020242056. Its totient is φ = 7000003373672.
The previous prime is 21000010120981. The next prime is 21000010121023. The reversal of 21000010121022 is 22012101000012.
It is a sphenic number, since it is the product of 3 distinct primes.
21000010121022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 21000010120989 and 21000010121007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21000010121023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1750000843413 + ... + 1750000843424.
It is an arithmetic number, because the mean of its divisors is an integer number (5250002530257).
Almost surely, 221000010121022 is an apocalyptic number.
21000010121022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21000010121022 is a wasteful number, since it uses less digits than its factorization.
21000010121022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3500001686842.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 21000010121022 its reverse (22012101000012), we get a palindrome (43012111121034).
The spelling of 21000010121022 in words is "twenty-one trillion, ten million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •