Base | Representation |
---|---|
bin | 110010010000000111100110… |
… | …101011000100100110111110 |
3 | 1001222112100110001102110001220 |
4 | 302100013212223010212332 |
5 | 212432011441030413042 |
6 | 2102014332100014210 |
7 | 64360305612365406 |
oct | 6220074653044676 |
9 | 1058470401373056 |
10 | 221010002201022 |
11 | 644698a7583a11 |
12 | 20955276691366 |
13 | 96421ccb19698 |
14 | 3c80d26861806 |
15 | 1a83e9d8318ec |
hex | c901e6ac49be |
221010002201022 has 32 divisors (see below), whose sum is σ = 469296443284992. Its totient is φ = 69147543552384.
The previous prime is 221010002200913. The next prime is 221010002201029. The reversal of 221010002201022 is 220102200010122.
It is a junction number, because it is equal to n+sod(n) for n = 221010002200992 and 221010002201010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221010002201029) by changing a digit.
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, 2951958108 + ... + 2952032975.
It is an arithmetic number, because the mean of its divisors is an integer number (14665513852656).
Almost surely, 2221010002201022 is an apocalyptic number.
221010002201022 is an abundant number, since it is smaller than the sum of its proper divisors (248286441083970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
221010002201022 is a wasteful number, since it uses less digits than its factorization.
221010002201022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5903991472.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 221010002201022 its reverse (220102200010122), we get a palindrome (441112202211144).
The spelling of 221010002201022 in words is "two hundred twenty-one trillion, ten billion, two million, two hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •