Base | Representation |
---|---|
bin | 110010010011001011001100… |
… | …001000000101110111001001 |
3 | 1002000021102111212120020000221 |
4 | 302103023030020011313021 |
5 | 212443432040104033001 |
6 | 2102255023020430041 |
7 | 64411422036166261 |
oct | 6223131410056711 |
9 | 1060242455506027 |
10 | 221220010221001 |
11 | 6453a974637700 |
12 | 20989b059a8321 |
13 | 9658c5a6a356c |
14 | 3c8b169b927a1 |
15 | 1a896906ea1a1 |
hex | c932cc205dc9 |
221220010221001 has 48 divisors (see below), whose sum is σ = 246972979116864. Its totient is φ = 197978085360000.
The previous prime is 221220010220971. The next prime is 221220010221059. The reversal of 221220010221001 is 100122010022122.
It is a happy number.
It is not a de Polignac number, because 221220010221001 - 223 = 221220001832393 is a prime.
It is a super-2 number, since 2×2212200102210012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (221220010225001) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 20357039770 + ... + 20357050636.
It is an arithmetic number, because the mean of its divisors is an integer number (5145270398268).
Almost surely, 2221220010221001 is an apocalyptic number.
It is an amenable number.
221220010221001 is a deficient number, since it is larger than the sum of its proper divisors (25752968895863).
221220010221001 is a wasteful number, since it uses less digits than its factorization.
221220010221001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20374 (or 20363 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 221220010221001 its reverse (100122010022122), we get a palindrome (321342020243123).
The spelling of 221220010221001 in words is "two hundred twenty-one trillion, two hundred twenty billion, ten million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •