Base | Representation |
---|---|
bin | 1001000110101110111111… |
… | …1110110010010000101101 |
3 | 1022110001220201012101200010 |
4 | 2101223233332302100231 |
5 | 2303011120300404401 |
6 | 33143043331323433 |
7 | 2052202230023022 |
oct | 221535776622055 |
9 | 38401821171603 |
10 | 10011300013101 |
11 | 320a84a955122 |
12 | 1158310150579 |
13 | 5780a52868ca |
14 | 268799bb7549 |
15 | 12563bee4ed6 |
hex | 91aeffb242d |
10011300013101 has 32 divisors (see below), whose sum is σ = 13521906478080. Its totient is φ = 6587601346944.
The previous prime is 10011300013093. The next prime is 10011300013109. The reversal of 10011300013101 is 10131000311001.
It is an interprime number because it is at equal distance from previous prime (10011300013093) and next prime (10011300013109).
It is not a de Polignac number, because 10011300013101 - 23 = 10011300013093 is a prime.
It is a super-2 number, since 2×100113000131012 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10011300013109) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2001056866 + ... + 2001061868.
It is an arithmetic number, because the mean of its divisors is an integer number (422559577440).
Almost surely, 210011300013101 is an apocalyptic number.
It is an amenable number.
10011300013101 is a deficient number, since it is larger than the sum of its proper divisors (3510606464979).
10011300013101 is a wasteful number, since it uses less digits than its factorization.
10011300013101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11025.
The product of its (nonzero) digits is 9, while the sum is 12.
Adding to 10011300013101 its reverse (10131000311001), we get a palindrome (20142300324102).
The spelling of 10011300013101 in words is "ten trillion, eleven billion, three hundred million, thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •