Base | Representation |
---|---|
bin | 1001001101000111110001… |
… | …1101101111100011100010 |
3 | 1022211120011001122020121000 |
4 | 2103101330131233203202 |
5 | 2311310332431333442 |
6 | 33305312034012430 |
7 | 2063135405035605 |
oct | 223217435574342 |
9 | 38746131566530 |
10 | 10121031121122 |
11 | 325233a238759 |
12 | 1175634a17116 |
13 | 585541b5811c |
14 | 26dc093a433c |
15 | 1284106c5d4c |
hex | 9347c76f8e2 |
10121031121122 has 64 divisors (see below), whose sum is σ = 23098846723200. Its totient is φ = 3283659374400.
The previous prime is 10121031121099. The next prime is 10121031121133. The reversal of 10121031121122 is 22112113012101.
It is a happy number.
10121031121122 is a `hidden beast` number, since 1 + 0 + 1 + 210 + 311 + 21 + 122 = 666.
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 = 10121031121095 and 10121031121104.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15404553 + ... + 16048124.
It is an arithmetic number, because the mean of its divisors is an integer number (360919480050).
Almost surely, 210121031121122 is an apocalyptic number.
10121031121122 is an abundant number, since it is smaller than the sum of its proper divisors (12977815602078).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10121031121122 is a wasteful number, since it uses less digits than its factorization.
10121031121122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31452848 (or 31452842 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 10121031121122 its reverse (22112113012101), we get a palindrome (32233144133223).
The spelling of 10121031121122 in words is "ten trillion, one hundred twenty-one billion, thirty-one million, one hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •