Base | Representation |
---|---|
bin | 10110111110000011001111… |
… | …100000100100001000001110 |
3 | 111020200112011000002222002010 |
4 | 112332003033200210020032 |
5 | 101220112214212102342 |
6 | 554504242553242050 |
7 | 30164351222624463 |
oct | 2676031740441016 |
9 | 436615130088063 |
10 | 101021112222222 |
11 | 2a2088a4264105 |
12 | b3b669a103326 |
13 | 444a33335926a |
14 | 1ad363b14166a |
15 | ba2bce74e29c |
hex | 5be0cf82420e |
101021112222222 has 16 divisors (see below), whose sum is σ = 205854341887440. Its totient is φ = 33038351166912.
The previous prime is 101021112222197. The next prime is 101021112222227. The reversal of 101021112222222 is 222222211120101.
It is a super-3 number, since 3×1010211122222223 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101021112222227) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 158838226447 + ... + 158838227082.
It is an arithmetic number, because the mean of its divisors is an integer number (12865896367965).
Almost surely, 2101021112222222 is an apocalyptic number.
101021112222222 is an abundant number, since it is smaller than the sum of its proper divisors (104833229665218).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101021112222222 is a wasteful number, since it uses less digits than its factorization.
101021112222222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317676453587.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 101021112222222 its reverse (222222211120101), we get a palindrome (323243323342323).
The spelling of 101021112222222 in words is "one hundred one trillion, twenty-one billion, one hundred twelve million, two hundred twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •