Base | Representation |
---|---|
bin | 1001001101001100100011… |
… | …1000001110000001110111 |
3 | 1022211200110101222001022010 |
4 | 2103103020320032001313 |
5 | 2311320444130130403 |
6 | 33310043151535303 |
7 | 2063212232655246 |
oct | 223231070160167 |
9 | 38750411861263 |
10 | 10122313130103 |
11 | 3252937968009 |
12 | 117593222a533 |
13 | 5856b7634215 |
14 | 26dccb76095d |
15 | 128488010603 |
hex | 934c8e0e077 |
10122313130103 has 16 divisors (see below), whose sum is σ = 14206868297600. Its totient is φ = 6392989009440.
The previous prime is 10122313130087. The next prime is 10122313130131. The reversal of 10122313130103 is 30103131322101.
It is a happy number.
It is not a de Polignac number, because 10122313130103 - 24 = 10122313130087 is a prime.
It is a super-2 number, since 2×101223131301032 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10122313130103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10122313130143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7312473 + ... + 8585853.
It is an arithmetic number, because the mean of its divisors is an integer number (887929268600).
Almost surely, 210122313130103 is an apocalyptic number.
10122313130103 is a deficient number, since it is larger than the sum of its proper divisors (4084555167497).
10122313130103 is a wasteful number, since it uses less digits than its factorization.
10122313130103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1412862.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 10122313130103 its reverse (30103131322101), we get a palindrome (40225444452204).
The spelling of 10122313130103 in words is "ten trillion, one hundred twenty-two billion, three hundred thirteen million, one hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •