Base | Representation |
---|---|
bin | 1001000110000101010001… |
… | …1110101111110000101111 |
3 | 1022102000000020200022110201 |
4 | 2101201110132233300233 |
5 | 2302320201402224213 |
6 | 33133552202214331 |
7 | 2051324554542526 |
oct | 221412436576057 |
9 | 38360006608421 |
10 | 10000101211183 |
11 | 3206023482526 |
12 | 11561057b43a7 |
13 | 57700c1043b5 |
14 | 2680167574bd |
15 | 1251d3c866dd |
hex | 918547afc2f |
10000101211183 has 2 divisors, whose sum is σ = 10000101211184. Its totient is φ = 10000101211182.
The previous prime is 10000101211171. The next prime is 10000101211259. The reversal of 10000101211183 is 38111210100001.
It is a weak prime.
It is an emirp because it is prime and its reverse (38111210100001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10000101211183 - 217 = 10000101080111 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10000101211183.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10000101211123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000050605591 + 5000050605592.
It is an arithmetic number, because the mean of its divisors is an integer number (5000050605592).
Almost surely, 210000101211183 is an apocalyptic number.
10000101211183 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000101211183 is an equidigital number, since it uses as much as digits as its factorization.
10000101211183 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 10000101211183 its reverse (38111210100001), we get a palindrome (48111311311184).
The spelling of 10000101211183 in words is "ten trillion, one hundred one million, two hundred eleven thousand, one hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •