Base | Representation |
---|---|
bin | 10110110000101010010100… |
… | …100111001110000111111101 |
3 | 111010102120011212201112022001 |
4 | 112300222110213032013331 |
5 | 101110023322241010023 |
6 | 552521433131022301 |
7 | 30041026060333651 |
oct | 2660522447160775 |
9 | 433376155645261 |
10 | 100101001110013 |
11 | 29993661554022 |
12 | b2882b289a991 |
13 | 43b163a190b77 |
14 | 1aa0cb2bcca61 |
15 | b88ccb8596ad |
hex | 5b0a949ce1fd |
100101001110013 has 2 divisors, whose sum is σ = 100101001110014. Its totient is φ = 100101001110012.
The previous prime is 100101001110007. The next prime is 100101001110053. The reversal of 100101001110013 is 310011100101001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98434931987844 + 1666069122169 = 9921438^2 + 1290763^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100101001110013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100101001110053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50050500555006 + 50050500555007.
It is an arithmetic number, because the mean of its divisors is an integer number (50050500555007).
Almost surely, 2100101001110013 is an apocalyptic number.
It is an amenable number.
100101001110013 is a deficient number, since it is larger than the sum of its proper divisors (1).
100101001110013 is an equidigital number, since it uses as much as digits as its factorization.
100101001110013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 100101001110013 its reverse (310011100101001), we get a palindrome (410112101211014).
The spelling of 100101001110013 in words is "one hundred trillion, one hundred one billion, one million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •