Base | Representation |
---|---|
bin | 1001000110000101010001… |
… | …1110101111011111111111 |
3 | 1022102000000020200021000000 |
4 | 2101201110132233133333 |
5 | 2302320201402210421 |
6 | 33133552202205343 |
7 | 2051324554536435 |
oct | 221412436573777 |
9 | 38360006607000 |
10 | 10000101210111 |
11 | 3206023481741 |
12 | 11561057b3853 |
13 | 57700c103a6c |
14 | 268016756d55 |
15 | 1251d3c86226 |
hex | 918547af7ff |
10000101210111 has 28 divisors (see below), whose sum is σ = 15018240936160. Its totient is φ = 6655641112800.
The previous prime is 10000101210109. The next prime is 10000101210133. The reversal of 10000101210111 is 11101210100001.
It is not a de Polignac number, because 10000101210111 - 21 = 10000101210109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10000101210093 and 10000101210102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000101210311) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 10974151 + ... + 11850408.
It is an arithmetic number, because the mean of its divisors is an integer number (536365747720).
Almost surely, 210000101210111 is an apocalyptic number.
10000101210111 is a deficient number, since it is larger than the sum of its proper divisors (5018139726049).
10000101210111 is an frugal number, since it uses more digits than its factorization.
10000101210111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22825178 (or 22825163 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10000101210111 its reverse (11101210100001), we get a palindrome (21101311310112).
The spelling of 10000101210111 in words is "ten trillion, one hundred one million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •