Base | Representation |
---|---|
bin | 1001001100000101000101… |
… | …1110011011110111000010 |
3 | 1022202211221111112201220000 |
4 | 2103001101132123313002 |
5 | 2311012202240404442 |
6 | 33253151443100430 |
7 | 2061632660112426 |
oct | 223012136336702 |
9 | 38684844481800 |
10 | 10103130013122 |
11 | 3245793560323 |
12 | 1172079971716 |
13 | 58394b270c23 |
14 | 26cdcbb5ab86 |
15 | 127c13d53d4c |
hex | 9305179bdc2 |
10103130013122 has 40 divisors (see below), whose sum is σ = 22722653101500. Its totient is φ = 3355190621856.
The previous prime is 10103130013057. The next prime is 10103130013201. The reversal of 10103130013122 is 22131003130101.
10103130013122 is a `hidden beast` number, since 10 + 10 + 31 + 300 + 1 + 312 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 9609807800961 + 493322212161 = 3099969^2 + 702369^2 .
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 = 10103130013095 and 10103130013104.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 115876497 + ... + 115963652.
Almost surely, 210103130013122 is an apocalyptic number.
10103130013122 is an abundant number, since it is smaller than the sum of its proper divisors (12619523088378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10103130013122 is a wasteful number, since it uses less digits than its factorization.
10103130013122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231840432 (or 231840423 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 10103130013122 its reverse (22131003130101), we get a palindrome (32234133143223).
The spelling of 10103130013122 in words is "ten trillion, one hundred three billion, one hundred thirty million, thirteen thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •