Base | Representation |
---|---|
bin | 1001010010011110110111… |
… | …1111001000000111100111 |
3 | 1100011100212120221121111121 |
4 | 2110213231333020013213 |
5 | 2314312442240323421 |
6 | 33415502552514411 |
7 | 2102605611504136 |
oct | 224475577100747 |
9 | 40140776847447 |
10 | 10213130011111 |
11 | 32884006a9975 |
12 | 118b4586aba07 |
13 | 59112b769c31 |
14 | 274464d3d91d |
15 | 12aa00e4ad41 |
hex | 949edfc81e7 |
10213130011111 has 2 divisors, whose sum is σ = 10213130011112. Its totient is φ = 10213130011110.
The previous prime is 10213130011067. The next prime is 10213130011127. The reversal of 10213130011111 is 11111003131201.
It is an a-pointer prime, because the next prime (10213130011127) can be obtained adding 10213130011111 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10213130011111 - 213 = 10213130002919 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10213130011151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106565005555 + 5106565005556.
It is an arithmetic number, because the mean of its divisors is an integer number (5106565005556).
Almost surely, 210213130011111 is an apocalyptic number.
10213130011111 is a deficient number, since it is larger than the sum of its proper divisors (1).
10213130011111 is an equidigital number, since it uses as much as digits as its factorization.
10213130011111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 10213130011111 its reverse (11111003131201), we get a palindrome (21324133142312).
The spelling of 10213130011111 in words is "ten trillion, two hundred thirteen billion, one hundred thirty million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •