Base | Representation |
---|---|
bin | 110011001110110110… |
… | …1000010011111101101 |
3 | 101111222111001200200202 |
4 | 1212131231002133231 |
5 | 3300310110341023 |
6 | 122313102403245 |
7 | 10643253446342 |
oct | 1463555023755 |
9 | 344874050622 |
10 | 110020012013 |
11 | 4272847946a |
12 | 193a5590525 |
13 | a4b46b5932 |
14 | 5479b127c9 |
15 | 2cddc4c128 |
hex | 199db427ed |
110020012013 has 2 divisors, whose sum is σ = 110020012014. Its totient is φ = 110020012012.
The previous prime is 110020011973. The next prime is 110020012049. The reversal of 110020012013 is 310210020011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 66029983369 + 43990028644 = 256963^2 + 209738^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110020012013 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 110020011985 and 110020012003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110020012313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55010006006 + 55010006007.
It is an arithmetic number, because the mean of its divisors is an integer number (55010006007).
Almost surely, 2110020012013 is an apocalyptic number.
It is an amenable number.
110020012013 is a deficient number, since it is larger than the sum of its proper divisors (1).
110020012013 is an equidigital number, since it uses as much as digits as its factorization.
110020012013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 110020012013 its reverse (310210020011), we get a palindrome (420230032024).
The spelling of 110020012013 in words is "one hundred ten billion, twenty million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •