Base | Representation |
---|---|
bin | 1001000110110101101101… |
… | …1000111100010011110001 |
3 | 1022110020120022000110001000 |
4 | 2101231123120330103301 |
5 | 2303023313110011423 |
6 | 33143542223032213 |
7 | 2052265000646535 |
oct | 221553330742361 |
9 | 38406508013030 |
10 | 10013102032113 |
11 | 3210595068734 |
12 | 115873373b669 |
13 | 57830170294b |
14 | 2688cb257bc5 |
15 | 1256e52eb843 |
hex | 91b5b63c4f1 |
10013102032113 has 64 divisors (see below), whose sum is σ = 15824548454400. Its totient is φ = 6235669059840.
The previous prime is 10013102032111. The next prime is 10013102032127. The reversal of 10013102032113 is 31123020131001.
10013102032113 is a `hidden beast` number, since 1 + 0 + 0 + 1 + 310 + 20 + 321 + 13 = 666.
It is not a de Polignac number, because 10013102032113 - 21 = 10013102032111 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10013102032111) 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 63 ways as a sum of consecutive naturals, for example, 231639820 + ... + 231683042.
It is an arithmetic number, because the mean of its divisors is an integer number (247258569600).
Almost surely, 210013102032113 is an apocalyptic number.
It is an amenable number.
10013102032113 is a deficient number, since it is larger than the sum of its proper divisors (5811446422287).
10013102032113 is a wasteful number, since it uses less digits than its factorization.
10013102032113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47019 (or 47013 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 10013102032113 its reverse (31123020131001), we get a palindrome (41136122163114).
The spelling of 10013102032113 in words is "ten trillion, thirteen billion, one hundred two million, thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •