Base | Representation |
---|---|
bin | 101101101110110101000110… |
… | …111110111010100010101110 |
3 | 222101010212020110102111020022 |
4 | 231232311012332322202232 |
5 | 202330304134341332342 |
6 | 1551433540034322142 |
7 | 60236115132241340 |
oct | 5556650676724256 |
9 | 871125213374208 |
10 | 201130214402222 |
11 | 590a4932637996 |
12 | 1a684471a29352 |
13 | 882c661989a61 |
14 | 3794a7bbc7290 |
15 | 183bcd23ba9d2 |
hex | b6ed46fba8ae |
201130214402222 has 32 divisors (see below), whose sum is σ = 344873534022144. Its totient is φ = 86178945333600.
The previous prime is 201130214402093. The next prime is 201130214402329. The reversal of 201130214402222 is 222204412031102.
It is a happy number.
201130214402222 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 201130214402191 and 201130214402200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1221695072 + ... + 1221859692.
It is an arithmetic number, because the mean of its divisors is an integer number (10777297938192).
Almost surely, 2201130214402222 is an apocalyptic number.
201130214402222 is a deficient number, since it is larger than the sum of its proper divisors (143743319619922).
201130214402222 is a wasteful number, since it uses less digits than its factorization.
201130214402222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184064.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 201130214402222 its reverse (222204412031102), we get a palindrome (423334626433324).
The spelling of 201130214402222 in words is "two hundred one trillion, one hundred thirty billion, two hundred fourteen million, four hundred two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •