Base | Representation |
---|---|
bin | 1001000110000101010010… |
… | …1101001111001110110101 |
3 | 1022102000000111211022121101 |
4 | 2101201110231033032311 |
5 | 2302320203340310401 |
6 | 33133552415450101 |
7 | 2051324632044223 |
oct | 221412455171665 |
9 | 38360014738541 |
10 | 10000105010101 |
11 | 3206025637728 |
12 | 1156106b26931 |
13 | 57700cb3458b |
14 | 268017065b13 |
15 | 1251d4287101 |
hex | 91854b4f3b5 |
10000105010101 has 2 divisors, whose sum is σ = 10000105010102. Its totient is φ = 10000105010100.
The previous prime is 10000105010083. The next prime is 10000105010113. The reversal of 10000105010101 is 10101050100001.
10000105010101 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., 9461714480100 + 538390530001 = 3075990^2 + 733751^2 .
It is a cyclic number.
It is not a de Polignac number, because 10000105010101 - 25 = 10000105010069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10000105010141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000052505050 + 5000052505051.
It is an arithmetic number, because the mean of its divisors is an integer number (5000052505051).
Almost surely, 210000105010101 is an apocalyptic number.
It is an amenable number.
10000105010101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000105010101 is an equidigital number, since it uses as much as digits as its factorization.
10000105010101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5, while the sum is 10.
Adding to 10000105010101 its reverse (10101050100001), we get a palindrome (20101155110102).
The spelling of 10000105010101 in words is "ten trillion, one hundred five million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •