Base | Representation |
---|---|
bin | 1001000110001100010110… |
… | …1010110110100101011101 |
3 | 1022102011220120222110111012 |
4 | 2101203011222312211131 |
5 | 2302333044023212034 |
6 | 33134504440305005 |
7 | 2051422614013154 |
oct | 221430552664535 |
9 | 38364816873435 |
10 | 10002000210269 |
11 | 3206908404661 |
12 | 1156555772165 |
13 | 5772526774b2 |
14 | 268156a4059b |
15 | 125295847cce |
hex | 918c5ab695d |
10002000210269 has 2 divisors, whose sum is σ = 10002000210270. Its totient is φ = 10002000210268.
The previous prime is 10002000210179. The next prime is 10002000210337. The reversal of 10002000210269 is 96201200020001.
10002000210269 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7850996653369 + 2151003556900 = 2801963^2 + 1466630^2 .
It is a cyclic number.
It is not a de Polignac number, because 10002000210269 - 212 = 10002000206173 is a prime.
It is a super-2 number, since 2×100020002102692 (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 (10002000213269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5001000105134 + 5001000105135.
It is an arithmetic number, because the mean of its divisors is an integer number (5001000105135).
Almost surely, 210002000210269 is an apocalyptic number.
It is an amenable number.
10002000210269 is a deficient number, since it is larger than the sum of its proper divisors (1).
10002000210269 is an equidigital number, since it uses as much as digits as its factorization.
10002000210269 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 23.
The spelling of 10002000210269 in words is "ten trillion, two billion, two hundred ten thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •