Base | Representation |
---|---|
bin | 1001001100100010111001… |
… | …1000100011001001000001 |
3 | 1022210121121010012020210000 |
4 | 2103020232120203021001 |
5 | 2311130044041431423 |
6 | 33300553424230213 |
7 | 2062335154104144 |
oct | 223105630431101 |
9 | 38717533166700 |
10 | 10111131202113 |
11 | 3249119a70007 |
12 | 117373146b369 |
13 | 584624b0c296 |
14 | 26d54a65405b |
15 | 1280314d6843 |
hex | 9322e623241 |
10111131202113 has 10 divisors (see below), whose sum is σ = 15104282413154. Its totient is φ = 6740754134688.
The previous prime is 10111131202069. The next prime is 10111131202199. The reversal of 10111131202113 is 31120213111101.
It can be written as a sum of positive squares in only one way, i.e., 5250019029264 + 4861112172849 = 2291292^2 + 2204793^2 .
It is not a de Polignac number, because 10111131202113 - 26 = 10111131202049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10111131282113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 62414390056 + ... + 62414390217.
Almost surely, 210111131202113 is an apocalyptic number.
It is an amenable number.
10111131202113 is a deficient number, since it is larger than the sum of its proper divisors (4993151211041).
10111131202113 is an equidigital number, since it uses as much as digits as its factorization.
10111131202113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124828780285 (or 124828780276 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 10111131202113 its reverse (31120213111101), we get a palindrome (41231344313214).
The spelling of 10111131202113 in words is "ten trillion, one hundred eleven billion, one hundred thirty-one million, two hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.751 sec. • engine limits •