Base | Representation |
---|---|
bin | 11001000010001010100111… |
… | …111111000101101010100101 |
3 | 112102211110101000000010102121 |
4 | 121002022213333011222211 |
5 | 103412334310024432023 |
6 | 1030055125113105541 |
7 | 32122314612501646 |
oct | 3102124777055245 |
9 | 472743330003377 |
10 | 110100009999013 |
11 | 32099174385741 |
12 | 104221526b82b1 |
13 | 4958503ba2178 |
14 | 1d28c244456cd |
15 | cade49774d5d |
hex | 6422a7fc5aa5 |
110100009999013 has 2 divisors, whose sum is σ = 110100009999014. Its totient is φ = 110100009999012.
The previous prime is 110100009998981. The next prime is 110100009999047. The reversal of 110100009999013 is 310999900001011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64627739783044 + 45472270215969 = 8039138^2 + 6743313^2 .
It is a cyclic number.
It is not a de Polignac number, because 110100009999013 - 25 = 110100009998981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110100009999073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050004999506 + 55050004999507.
It is an arithmetic number, because the mean of its divisors is an integer number (55050004999507).
Almost surely, 2110100009999013 is an apocalyptic number.
It is an amenable number.
110100009999013 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100009999013 is an equidigital number, since it uses as much as digits as its factorization.
110100009999013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 19683, while the sum is 43.
The spelling of 110100009999013 in words is "one hundred ten trillion, one hundred billion, nine million, nine hundred ninety-nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •