Base | Representation |
---|---|
bin | 1001000110110101110001… |
… | …1110101011011100010111 |
3 | 1022110020121120102012212000 |
4 | 2101231130132223130113 |
5 | 2303023332300004421 |
6 | 33143544114530343 |
7 | 2052265312226106 |
oct | 221553436533427 |
9 | 38406546365760 |
10 | 10013120313111 |
11 | 32105a44144a3 |
12 | 11587398969b3 |
13 | 5783054337c6 |
14 | 2688cd85603d |
15 | 1256e6c0d226 |
hex | 91b5c7ab717 |
10013120313111 has 48 divisors (see below), whose sum is σ = 15626407737600. Its totient is φ = 6319459461888.
The previous prime is 10013120313109. The next prime is 10013120313137. The reversal of 10013120313111 is 11131302131001.
10013120313111 is a `hidden beast` number, since 10 + 0 + 1 + 312 + 0 + 31 + 311 + 1 = 666.
It is not a de Polignac number, because 10013120313111 - 21 = 10013120313109 is a prime.
It is a super-2 number, since 2×100131203131112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10013120313611) 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, 3449230486 + ... + 3449233388.
It is an arithmetic number, because the mean of its divisors is an integer number (325550161200).
Almost surely, 210013120313111 is an apocalyptic number.
10013120313111 is a deficient number, since it is larger than the sum of its proper divisors (5613287424489).
10013120313111 is an frugal number, since it uses more digits than its factorization.
10013120313111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8117 (or 5518 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 10013120313111 its reverse (11131302131001), we get a palindrome (21144422444112).
The spelling of 10013120313111 in words is "ten trillion, thirteen billion, one hundred twenty million, three hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •