Base | Representation |
---|---|
bin | 11101100011111001010111… |
… | …001101001001001011111101 |
3 | 122001022211212000102201110211 |
4 | 131203321113031021023331 |
5 | 114020041213004110323 |
6 | 1140301454231232421 |
7 | 36245631022562200 |
oct | 3543712715111375 |
9 | 561284760381424 |
10 | 130010123113213 |
11 | 38474a9015aaa2 |
12 | 126b89bb218711 |
13 | 5770b959195c5 |
14 | 241674880b937 |
15 | 1006cdd17470d |
hex | 763e573492fd |
130010123113213 has 48 divisors (see below), whose sum is σ = 156195032568960. Its totient is φ = 107831985174144.
The previous prime is 130010123113183. The next prime is 130010123113313. The reversal of 130010123113213 is 312311321010031.
It is a de Polignac number, because none of the positive numbers 2k-130010123113213 is a prime.
It is a super-2 number, since 2×1300101231132132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130010123113313) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1820502895 + ... + 1820574307.
It is an arithmetic number, because the mean of its divisors is an integer number (3254063178520).
Almost surely, 2130010123113213 is an apocalyptic number.
It is an amenable number.
130010123113213 is a deficient number, since it is larger than the sum of its proper divisors (26184909455747).
130010123113213 is a wasteful number, since it uses less digits than its factorization.
130010123113213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79506 (or 79499 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 130010123113213 its reverse (312311321010031), we get a palindrome (442321444123244).
The spelling of 130010123113213 in words is "one hundred thirty trillion, ten billion, one hundred twenty-three million, one hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •