Base | Representation |
---|---|
bin | 1001001011111101111110… |
… | …1100001010111010100111 |
3 | 1022202200000110102101102211 |
4 | 2102333133230022322213 |
5 | 2310444300034323421 |
6 | 33252234210344251 |
7 | 2061534446631046 |
oct | 222773754127247 |
9 | 38680013371384 |
10 | 10101221011111 |
11 | 32449a3a1690a |
12 | 117182658b087 |
13 | 583705907b39 |
14 | 26cc8a3cc55d |
15 | 127b514689e1 |
hex | 92fdfb0aea7 |
10101221011111 has 8 divisors (see below), whose sum is σ = 10103328129024. Its totient is φ = 10099114068120.
The previous prime is 10101221011067. The next prime is 10101221011121. The reversal of 10101221011111 is 11111012210101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10101221011111 - 217 = 10101220880039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10101221011091 and 10101221011100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101221011121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 211267770 + ... + 211315576.
It is an arithmetic number, because the mean of its divisors is an integer number (1262916016128).
Almost surely, 210101221011111 is an apocalyptic number.
10101221011111 is a deficient number, since it is larger than the sum of its proper divisors (2107117913).
10101221011111 is an equidigital number, since it uses as much as digits as its factorization.
10101221011111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87461.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 10101221011111 its reverse (11111012210101), we get a palindrome (21212233221212).
The spelling of 10101221011111 in words is "ten trillion, one hundred one billion, two hundred twenty-one million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •