Base | Representation |
---|---|
bin | 10110111111100000011000… |
… | …011111110111000100001110 |
3 | 111021001002021210022101122202 |
4 | 112333200120133313010032 |
5 | 101223232023440202342 |
6 | 555022222433041502 |
7 | 30204521434454120 |
oct | 2677403037670416 |
9 | 437032253271582 |
10 | 101121121022222 |
11 | 2a24725465a834 |
12 | b411b4a9b6292 |
13 | 44568b092a2b2 |
14 | 1ad8407413210 |
15 | ba55d4626332 |
hex | 5bf8187f710e |
101121121022222 has 32 divisors (see below), whose sum is σ = 173997716889600. Its totient is φ = 43175822552928.
The previous prime is 101121121022209. The next prime is 101121121022239. The reversal of 101121121022222 is 222220121121101.
101121121022222 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×1011211210222222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101121121022194 and 101121121022203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 283488179 + ... + 283844657.
It is an arithmetic number, because the mean of its divisors is an integer number (5437428652800).
Almost surely, 2101121121022222 is an apocalyptic number.
101121121022222 is a deficient number, since it is larger than the sum of its proper divisors (72876595867378).
101121121022222 is a wasteful number, since it uses less digits than its factorization.
101121121022222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 432080.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 101121121022222 its reverse (222220121121101), we get a palindrome (323341242143323).
The spelling of 101121121022222 in words is "one hundred one trillion, one hundred twenty-one billion, one hundred twenty-one million, twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •