Base | Representation |
---|---|
bin | 1001001101001011110011… |
… | …0101111011001101001010 |
3 | 1022211122221100000001012000 |
4 | 2103102330311323031022 |
5 | 2311320040431431442 |
6 | 33310011135531430 |
7 | 2063204231421033 |
oct | 223227465731512 |
9 | 38748840001160 |
10 | 10122111202122 |
11 | 3252843988587 |
12 | 1175896689b76 |
13 | 5856848534ca |
14 | 26dcac9d9a8a |
15 | 128475424d4c |
hex | 934bcd7b34a |
10122111202122 has 16 divisors (see below), whose sum is σ = 22493580449280. Its totient is φ = 3374037067356.
The previous prime is 10122111202109. The next prime is 10122111202129. The reversal of 10122111202122 is 22120211122101.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 10122111202095 and 10122111202104.
It is not an unprimeable number, because it can be changed into a prime (10122111202129) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 93723251818 + ... + 93723251925.
It is an arithmetic number, because the mean of its divisors is an integer number (1405848778080).
Almost surely, 210122111202122 is an apocalyptic number.
10122111202122 is an abundant number, since it is smaller than the sum of its proper divisors (12371469247158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122111202122 is a wasteful number, since it uses less digits than its factorization.
10122111202122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 187446503754 (or 187446503748 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 10122111202122 its reverse (22120211122101), we get a palindrome (32242322324223).
The spelling of 10122111202122 in words is "ten trillion, one hundred twenty-two billion, one hundred eleven million, two hundred two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •