Base | Representation |
---|---|
bin | 10110111111011000000101… |
… | …011111011110110001011110 |
3 | 111021000020021220211101212202 |
4 | 112333120011133132301132 |
5 | 101223110302312033042 |
6 | 555014150430331502 |
7 | 30204054610060562 |
oct | 2677300537366136 |
9 | 437006256741782 |
10 | 101112212221022 |
11 | 2a2434a2899612 |
12 | b410283359b92 |
13 | 4455ac102b7b2 |
14 | 1ad7c0017b6a2 |
15 | ba5262461632 |
hex | 5bf6057dec5e |
101112212221022 has 32 divisors (see below), whose sum is σ = 151989401535840. Its totient is φ = 50449220236800.
The previous prime is 101112212220997. The next prime is 101112212221049. The reversal of 101112212221022 is 220122212211101.
101112212221022 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 = 101112212220985 and 101112212221003.
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, 10212318272 + ... + 10212328172.
It is an arithmetic number, because the mean of its divisors is an integer number (4749668797995).
Almost surely, 2101112212221022 is an apocalyptic number.
101112212221022 is a deficient number, since it is larger than the sum of its proper divisors (50877189314818).
101112212221022 is a wasteful number, since it uses less digits than its factorization.
101112212221022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16028.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 101112212221022 its reverse (220122212211101), we get a palindrome (321234424432123).
The spelling of 101112212221022 in words is "one hundred one trillion, one hundred twelve billion, two hundred twelve million, two hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •