Base | Representation |
---|---|
bin | 11101011110110111100… |
… | …00011001111100001111 |
3 | 10120211202000010221111202 |
4 | 32233123300121330033 |
5 | 113044113034322111 |
6 | 2053211231540115 |
7 | 133121121514325 |
oct | 16573360317417 |
9 | 3524660127452 |
10 | 1013004214031 |
11 | 360681519417 |
12 | 1443b108a63b |
13 | 746ab4b4644 |
14 | 3705b58bd15 |
15 | 1b53d24bb3b |
hex | ebdbc19f0f |
1013004214031 has 2 divisors, whose sum is σ = 1013004214032. Its totient is φ = 1013004214030.
The previous prime is 1013004213943. The next prime is 1013004214049. The reversal of 1013004214031 is 1304124003101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1013004214031 - 218 = 1013003951887 is a prime.
It is a super-2 number, since 2×10130042140312 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1013004213994 and 1013004214012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013004214051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506502107015 + 506502107016.
It is an arithmetic number, because the mean of its divisors is an integer number (506502107016).
Almost surely, 21013004214031 is an apocalyptic number.
1013004214031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013004214031 is an equidigital number, since it uses as much as digits as its factorization.
1013004214031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1013004214031 its reverse (1304124003101), we get a palindrome (2317128217132).
The spelling of 1013004214031 in words is "one trillion, thirteen billion, four million, two hundred fourteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •