Base | Representation |
---|---|
bin | 11101001111111101010… |
… | …10110000010111110101 |
3 | 10120002002011210210102202 |
4 | 32213332222300113311 |
5 | 112431220000013023 |
6 | 2045405101514245 |
7 | 132415560026321 |
oct | 16477652602765 |
9 | 3502064723382 |
10 | 1005000001013 |
11 | 358244333738 |
12 | 142938572985 |
13 | 73a04127a18 |
14 | 368dc508981 |
15 | 1b2206bd128 |
hex | e9feab05f5 |
1005000001013 has 2 divisors, whose sum is σ = 1005000001014. Its totient is φ = 1005000001012.
The previous prime is 1005000001009. The next prime is 1005000001069. The reversal of 1005000001013 is 3101000005001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 944051254129 + 60948746884 = 971623^2 + 246878^2 .
It is a cyclic number.
It is not a de Polignac number, because 1005000001013 - 22 = 1005000001009 is a prime.
It is a super-2 number, since 2×10050000010132 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1005000000985 and 1005000001003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1005000001003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 502500000506 + 502500000507.
It is an arithmetic number, because the mean of its divisors is an integer number (502500000507).
Almost surely, 21005000001013 is an apocalyptic number.
It is an amenable number.
1005000001013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1005000001013 is an equidigital number, since it uses as much as digits as its factorization.
1005000001013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15, while the sum is 11.
Adding to 1005000001013 its reverse (3101000005001), we get a palindrome (4106000006014).
The spelling of 1005000001013 in words is "one trillion, five billion, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •