Base | Representation |
---|---|
bin | 1001001101001011110001… |
… | …0011010100010111001010 |
3 | 1022211122220200221010202000 |
4 | 2103102330103110113022 |
5 | 2311320031121130442 |
6 | 33310010213251430 |
7 | 2063204061335043 |
oct | 223227423242712 |
9 | 38748820833660 |
10 | 10122102130122 |
11 | 3252839851664 |
12 | 1175893633b76 |
13 | 5856829c8168 |
14 | 26dcab7178ca |
15 | 128474731d4c |
hex | 934bc4d45ca |
10122102130122 has 64 divisors (see below), whose sum is σ = 22559977440000. Its totient is φ = 3364078094784.
The previous prime is 10122102130099. The next prime is 10122102130169. The reversal of 10122102130122 is 22103120122101.
10122102130122 is a `hidden beast` number, since 101 + 221 + 0 + 21 + 301 + 22 = 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 = 10122102130095 and 10122102130104.
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, 55848504 + ... + 56029452.
It is an arithmetic number, because the mean of its divisors is an integer number (352499647500).
Almost surely, 210122102130122 is an apocalyptic number.
10122102130122 is an abundant number, since it is smaller than the sum of its proper divisors (12437875309878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122102130122 is a wasteful number, since it uses less digits than its factorization.
10122102130122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184012 (or 184006 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 10122102130122 its reverse (22103120122101), we get a palindrome (32225222252223).
The spelling of 10122102130122 in words is "ten trillion, one hundred twenty-two billion, one hundred two million, one hundred thirty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •