Base | Representation |
---|---|
bin | 1001000110001001000000… |
… | …00010000010000101100101 |
3 | 2121211012011201100020011011 |
4 | 10203010200002002011211 |
5 | 10110204001211214341 |
6 | 110312514525542221 |
7 | 4133053110412102 |
oct | 443044002020545 |
9 | 77735151306134 |
10 | 20002200101221 |
11 | 6411981556708 |
12 | 22b0688414971 |
13 | b2127904c490 |
14 | 4d217c523aa9 |
15 | 24a4830c2b81 |
hex | 123120082165 |
20002200101221 has 16 divisors (see below), whose sum is σ = 21706194299328. Its totient is φ = 18321841324800.
The previous prime is 20002200101209. The next prime is 20002200101227. The reversal of 20002200101221 is 12210100220002.
It is a happy number.
It is not a de Polignac number, because 20002200101221 - 215 = 20002200068453 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20002200101227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41564301 + ... + 42042781.
It is an arithmetic number, because the mean of its divisors is an integer number (1356637143708).
Almost surely, 220002200101221 is an apocalyptic number.
It is an amenable number.
20002200101221 is a deficient number, since it is larger than the sum of its proper divisors (1703994198107).
20002200101221 is a wasteful number, since it uses less digits than its factorization.
20002200101221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 503172.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20002200101221 its reverse (12210100220002), we get a palindrome (32212300321223).
The spelling of 20002200101221 in words is "twenty trillion, two billion, two hundred million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •