Base | Representation |
---|---|
bin | 1001001110010000000000… |
… | …1001110100111101110111 |
3 | 1022220102012022220201222100 |
4 | 2103210000021310331313 |
5 | 2312120040103041403 |
6 | 33322240024433143 |
7 | 2064423032623143 |
oct | 223440011647567 |
9 | 38812168821870 |
10 | 10140420362103 |
11 | 325a589a30459 |
12 | 11793463187b3 |
13 | 587311b3ac95 |
14 | 270b28502223 |
15 | 128b979eb2a3 |
hex | 93900274f77 |
10140420362103 has 12 divisors (see below), whose sum is σ = 14647357892440. Its totient is φ = 6760241455536.
The previous prime is 10140420362077. The next prime is 10140420362129. The reversal of 10140420362103 is 30126302404101.
It is a happy number.
10140420362103 is a `hidden beast` number, since 1 + 0 + 14 + 0 + 4 + 20 + 3 + 621 + 0 + 3 = 666.
It is an interprime number because it is at equal distance from previous prime (10140420362077) and next prime (10140420362129).
It is not a de Polignac number, because 10140420362103 - 28 = 10140420361847 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10140420362183) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1529101 + ... + 4755942.
Almost surely, 210140420362103 is an apocalyptic number.
10140420362103 is a deficient number, since it is larger than the sum of its proper divisors (4506937530337).
10140420362103 is a wasteful number, since it uses less digits than its factorization.
10140420362103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6464318 (or 6464315 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 10140420362103 its reverse (30126302404101), we get a palindrome (40266722766204).
The spelling of 10140420362103 in words is "ten trillion, one hundred forty billion, four hundred twenty million, three hundred sixty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •