Base | Representation |
---|---|
bin | 111100000000010… |
… | …1011000001000101 |
3 | 12012022122110100021 |
4 | 1320000223001011 |
5 | 13110420121432 |
6 | 531443015141 |
7 | 100615655431 |
oct | 17000530105 |
9 | 5168573307 |
10 | 2013442117 |
11 | 943598955 |
12 | 48236a4b1 |
13 | 2611a288b |
14 | 1515979c1 |
15 | bbb6a697 |
hex | 7802b045 |
2013442117 has 2 divisors, whose sum is σ = 2013442118. Its totient is φ = 2013442116.
The previous prime is 2013442091. The next prime is 2013442121. The reversal of 2013442117 is 7112443102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1645032481 + 368409636 = 40559^2 + 19194^2 .
It is a cyclic number.
It is not a de Polignac number, because 2013442117 - 211 = 2013440069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2013442091 and 2013442100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2013442147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006721058 + 1006721059.
It is an arithmetic number, because the mean of its divisors is an integer number (1006721059).
Almost surely, 22013442117 is an apocalyptic number.
It is an amenable number.
2013442117 is a deficient number, since it is larger than the sum of its proper divisors (1).
2013442117 is an equidigital number, since it uses as much as digits as its factorization.
2013442117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 25.
The square root of 2013442117 is about 44871.3953092613. The cubic root of 2013442117 is about 1262.7374173244.
Adding to 2013442117 its reverse (7112443102), we get a palindrome (9125885219).
The spelling of 2013442117 in words is "two billion, thirteen million, four hundred forty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •