Base | Representation |
---|---|
bin | 110011001110100111… |
… | …0110111000110010101 |
3 | 101111221221011202211202 |
4 | 1212131032313012111 |
5 | 3300301044213023 |
6 | 122312221042245 |
7 | 10643126300243 |
oct | 1463516670625 |
9 | 344857152752 |
10 | 110012101013 |
11 | 42723a65851 |
12 | 193a29b6385 |
13 | a4b2b75b79 |
14 | 5478a53793 |
15 | 2cdd1d8128 |
hex | 199d3b7195 |
110012101013 has 2 divisors, whose sum is σ = 110012101014. Its totient is φ = 110012101012.
The previous prime is 110012101009. The next prime is 110012101063. The reversal of 110012101013 is 310101210011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91362921169 + 18649179844 = 302263^2 + 136562^2 .
It is a cyclic number.
It is not a de Polignac number, because 110012101013 - 22 = 110012101009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110012100985 and 110012101003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110012101063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55006050506 + 55006050507.
It is an arithmetic number, because the mean of its divisors is an integer number (55006050507).
Almost surely, 2110012101013 is an apocalyptic number.
It is an amenable number.
110012101013 is a deficient number, since it is larger than the sum of its proper divisors (1).
110012101013 is an equidigital number, since it uses as much as digits as its factorization.
110012101013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 110012101013 its reverse (310101210011), we get a palindrome (420113311024).
The spelling of 110012101013 in words is "one hundred ten billion, twelve million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •