Base | Representation |
---|---|
bin | 1001000110001101001000… |
… | …1111110000001101111101 |
3 | 1022102012110022000100212002 |
4 | 2101203102033300031331 |
5 | 2302334012032210414 |
6 | 33134541414552045 |
7 | 2051431055333066 |
oct | 221432217601575 |
9 | 38365408010762 |
10 | 10002211210109 |
11 | 3206a0651a998 |
12 | 11565b4368625 |
13 | 5772872b3481 |
14 | 268176a8756d |
15 | 1252a91264de |
hex | 918d23f037d |
10002211210109 has 2 divisors, whose sum is σ = 10002211210110. Its totient is φ = 10002211210108.
The previous prime is 10002211210081. The next prime is 10002211210163. The reversal of 10002211210109 is 90101211220001.
10002211210109 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8614048900900 + 1388162309209 = 2934970^2 + 1178203^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10002211210109 is a prime.
It is a super-2 number, since 2×100022112101092 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10002211210909) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5001105605054 + 5001105605055.
It is an arithmetic number, because the mean of its divisors is an integer number (5001105605055).
Almost surely, 210002211210109 is an apocalyptic number.
It is an amenable number.
10002211210109 is a deficient number, since it is larger than the sum of its proper divisors (1).
10002211210109 is an equidigital number, since it uses as much as digits as its factorization.
10002211210109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 10002211210109 in words is "ten trillion, two billion, two hundred eleven million, two hundred ten thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •