Base | Representation |
---|---|
bin | 10111000000110101000010… |
… | …101000010111111010101110 |
3 | 111021100202220211221012022102 |
4 | 113000311002220113322232 |
5 | 101231224210141211342 |
6 | 555132054445015102 |
7 | 30214220156015000 |
oct | 2700650250277256 |
9 | 437322824835272 |
10 | 101212022210222 |
11 | 2a281860a447a0 |
12 | b427699554492 |
13 | 44623393708c1 |
14 | 1adc98bc9a370 |
15 | ba7b54b66832 |
hex | 5c0d42a17eae |
101212022210222 has 128 divisors (see below), whose sum is σ = 193453482470400. Its totient is φ = 39369811985280.
The previous prime is 101212022210213. The next prime is 101212022210237. The reversal of 101212022210222 is 222012220212101.
It is a super-2 number, since 2×1012120222102222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101212022210194 and 101212022210203.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 17251066133 + ... + 17251071999.
It is an arithmetic number, because the mean of its divisors is an integer number (1511355331800).
Almost surely, 2101212022210222 is an apocalyptic number.
101212022210222 is a deficient number, since it is larger than the sum of its proper divisors (92241460260178).
101212022210222 is a wasteful number, since it uses less digits than its factorization.
101212022210222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9191 (or 9177 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 101212022210222 its reverse (222012220212101), we get a palindrome (323224242422323).
The spelling of 101212022210222 in words is "one hundred one trillion, two hundred twelve billion, twenty-two million, two hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •