Base | Representation |
---|---|
bin | 1001001101101001101001… |
… | …0101100000001010101101 |
3 | 1022212102121122010111211001 |
4 | 2103122122111200022231 |
5 | 2311432442241241023 |
6 | 33313414111400301 |
7 | 2063606605035016 |
oct | 223323225401255 |
9 | 38772548114731 |
10 | 10130122212013 |
11 | 3256184995911 |
12 | 1177351523091 |
13 | 58636044ca4b |
14 | 27042c92c00d |
15 | 1287938976ad |
hex | 9369a5602ad |
10130122212013 has 8 divisors (see below), whose sum is σ = 10171747729440. Its totient is φ = 10088557508400.
The previous prime is 10130122211983. The next prime is 10130122212019. The reversal of 10130122212013 is 31021222103101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10130122212013 - 221 = 10130120114861 is a prime.
It is a super-2 number, since 2×101301222120132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10130122212019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14869603 + ... + 15535936.
It is an arithmetic number, because the mean of its divisors is an integer number (1271468466180).
Almost surely, 210130122212013 is an apocalyptic number.
It is an amenable number.
10130122212013 is a deficient number, since it is larger than the sum of its proper divisors (41625517427).
10130122212013 is a wasteful number, since it uses less digits than its factorization.
10130122212013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30406907.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10130122212013 its reverse (31021222103101), we get a palindrome (41151344315114).
The spelling of 10130122212013 in words is "ten trillion, one hundred thirty billion, one hundred twenty-two million, two hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •