Base | Representation |
---|---|
bin | 1011101101100111000… |
… | …1001011101010010110 |
3 | 201020101111202222010210 |
4 | 2323121301023222112 |
5 | 11244100320404220 |
6 | 232235022430250 |
7 | 20352320104260 |
oct | 2733161135226 |
9 | 636344688123 |
10 | 201222044310 |
11 | 78379664181 |
12 | 32bb8a32386 |
13 | 15c8a561411 |
14 | 9a4c50cb30 |
15 | 537a8b66e0 |
hex | 2ed9c4ba96 |
201222044310 has 64 divisors (see below), whose sum is σ = 566840189952. Its totient is φ = 44750537856.
The previous prime is 201222044291. The next prime is 201222044311. The reversal of 201222044310 is 13440222102.
201222044310 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2012220443102 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201222044311) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12940882 + ... + 12956421.
It is an arithmetic number, because the mean of its divisors is an integer number (8856877968).
Almost surely, 2201222044310 is an apocalyptic number.
201222044310 is an abundant number, since it is smaller than the sum of its proper divisors (365618145642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201222044310 is a wasteful number, since it uses less digits than its factorization.
201222044310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25897357.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 201222044310 its reverse (13440222102), we get a palindrome (214662266412).
The spelling of 201222044310 in words is "two hundred one billion, two hundred twenty-two million, forty-four thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •