Base | Representation |
---|---|
bin | 1001001101101001100111… |
… | …0010010111011000110101 |
3 | 1022212102120222210112200220 |
4 | 2103122121302113120311 |
5 | 2311432432412013023 |
6 | 33313413142124553 |
7 | 2063606433532545 |
oct | 223323162273065 |
9 | 38772528715626 |
10 | 10130113001013 |
11 | 325617a774515 |
12 | 117734a420759 |
13 | 58635b576355 |
14 | 27042b611325 |
15 | 128792b783e3 |
hex | 93699c97635 |
10130113001013 has 16 divisors (see below), whose sum is σ = 13577963904000. Its totient is φ = 6717837624320.
The previous prime is 10130113000957. The next prime is 10130113001017. The reversal of 10130113001013 is 31010031103101.
It is a cyclic number.
It is not a de Polignac number, because 10130113001013 - 220 = 10130111952437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10130113000983 and 10130113001001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10130113001017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18971713 + ... + 19498361.
It is an arithmetic number, because the mean of its divisors is an integer number (848622744000).
Almost surely, 210130113001013 is an apocalyptic number.
It is an amenable number.
10130113001013 is a deficient number, since it is larger than the sum of its proper divisors (3447850902987).
10130113001013 is a wasteful number, since it uses less digits than its factorization.
10130113001013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560412.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 10130113001013 its reverse (31010031103101), we get a palindrome (41140144104114).
The spelling of 10130113001013 in words is "ten trillion, one hundred thirty billion, one hundred thirteen million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •