Base | Representation |
---|---|
bin | 10110111111001101110000… |
… | …011110011111010010100110 |
3 | 111020222011200001001001010102 |
4 | 112333031300132133102212 |
5 | 101222420044242034342 |
6 | 555005114145224102 |
7 | 30203213025452624 |
oct | 2677156036372246 |
9 | 436864601031112 |
10 | 101101122221222 |
11 | 2a23982187a622 |
12 | b40a0a9332032 |
13 | 4454a44582336 |
14 | 1ad746b360514 |
15 | ba4d13a45832 |
hex | 5bf37079f4a6 |
101101122221222 has 4 divisors (see below), whose sum is σ = 151651683331836. Its totient is φ = 50550561110610.
The previous prime is 101101122221221. The next prime is 101101122221227. The reversal of 101101122221222 is 222122221101101.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1011011222212222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101101122221194 and 101101122221203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101101122221221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25275280555304 + ... + 25275280555307.
It is an arithmetic number, because the mean of its divisors is an integer number (37912920832959).
Almost surely, 2101101122221222 is an apocalyptic number.
101101122221222 is a deficient number, since it is larger than the sum of its proper divisors (50550561110614).
101101122221222 is an equidigital number, since it uses as much as digits as its factorization.
101101122221222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50550561110613.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 101101122221222 its reverse (222122221101101), we get a palindrome (323223343322323).
The spelling of 101101122221222 in words is "one hundred one trillion, one hundred one billion, one hundred twenty-two million, two hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •