Base | Representation |
---|---|
bin | 10111000000111101100110… |
… | …111000000000010010101010 |
3 | 111021101122122212121121120211 |
4 | 113000331212320000102222 |
5 | 101231402024334101442 |
6 | 555140215302211334 |
7 | 30214664124563140 |
oct | 2700754670002252 |
9 | 437348585547524 |
10 | 101221220222122 |
11 | 2a285750a90220 |
12 | b429425a23b4a |
13 | 4463173b602b0 |
14 | 1add1c16d7590 |
15 | ba7ee2408617 |
hex | 5c0f66e004aa |
101221220222122 has 32 divisors (see below), whose sum is σ = 203858121849984. Its totient is φ = 36403236043200.
The previous prime is 101221220222113. The next prime is 101221220222123. The reversal of 101221220222122 is 221222022122101.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 101221220222093 and 101221220222102.
It is not an unprimeable number, because it can be changed into a prime (101221220222123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25280023029 + ... + 25280027032.
It is an arithmetic number, because the mean of its divisors is an integer number (6370566307812).
Almost surely, 2101221220222122 is an apocalyptic number.
101221220222122 is an abundant number, since it is smaller than the sum of its proper divisors (102636901627862).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101221220222122 is a wasteful number, since it uses less digits than its factorization.
101221220222122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50560050094.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 101221220222122 its reverse (221222022122101), we get a palindrome (322443242344223).
The spelling of 101221220222122 in words is "one hundred one trillion, two hundred twenty-one billion, two hundred twenty million, two hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •