Base | Representation |
---|---|
bin | 1001000110110101110000… |
… | …1010110110000010001010 |
3 | 1022110020121012122001110220 |
4 | 2101231130022312002022 |
5 | 2303023324432113420 |
6 | 33143543411250510 |
7 | 2052265220102160 |
oct | 221553412660212 |
9 | 38406535561426 |
10 | 10013115113610 |
11 | 32105a1492a94 |
12 | 1158737ba9a36 |
13 | 578304332c8b |
14 | 2688ccca1230 |
15 | 1256e6532840 |
hex | 91b5c2b608a |
10013115113610 has 64 divisors (see below), whose sum is σ = 27529781001984. Its totient is φ = 2283275635200.
The previous prime is 10013115113597. The next prime is 10013115113657. The reversal of 10013115113610 is 1631151131001.
It is a happy number.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 56540451 + ... + 56717270.
It is an arithmetic number, because the mean of its divisors is an integer number (430152828156).
Almost surely, 210013115113610 is an apocalyptic number.
10013115113610 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10013115113610 is an abundant number, since it is smaller than the sum of its proper divisors (17516665888374).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10013115113610 is a wasteful number, since it uses less digits than its factorization.
10013115113610 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113258159.
The product of its (nonzero) digits is 270, while the sum is 24.
Adding to 10013115113610 its reverse (1631151131001), we get a palindrome (11644266244611).
The spelling of 10013115113610 in words is "ten trillion, thirteen billion, one hundred fifteen million, one hundred thirteen thousand, six hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •