Base | Representation |
---|---|
bin | 10110111101111010000001… |
… | …111101011000101101111110 |
3 | 111020122120121200110000002201 |
4 | 112331322001331120231332 |
5 | 101214431440113021342 |
6 | 554455525302542114 |
7 | 30163551140532115 |
oct | 2675720175305576 |
9 | 436576550400081 |
10 | 101011221220222 |
11 | 2a204689026995 |
12 | b3b479973793a |
13 | 4449418113061 |
14 | 1ad2d7d672c7c |
15 | ba2801221db7 |
hex | 5bde81f58b7e |
101011221220222 has 96 divisors (see below), whose sum is σ = 168579927069120. Its totient is φ = 45182578129920.
The previous prime is 101011221220219. The next prime is 101011221220249. The reversal of 101011221220222 is 222022122110101.
It is a super-3 number, since 3×1010112212202223 (a number of 43 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101011221220222.
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 47 ways as a sum of consecutive naturals, for example, 8237066463 + ... + 8237078725.
It is an arithmetic number, because the mean of its divisors is an integer number (1756040906970).
Almost surely, 2101011221220222 is an apocalyptic number.
101011221220222 is a deficient number, since it is larger than the sum of its proper divisors (67568705848898).
101011221220222 is a wasteful number, since it uses less digits than its factorization.
101011221220222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14306 (or 14239 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 101011221220222 its reverse (222022122110101), we get a palindrome (323033343330323).
The spelling of 101011221220222 in words is "one hundred one trillion, eleven billion, two hundred twenty-one million, two hundred twenty thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •