Base | Representation |
---|---|
bin | 11101001000100111110… |
… | …00111001000000000101 |
3 | 10112200220122222220000021 |
4 | 32210103320321000011 |
5 | 112400133112414423 |
6 | 2043514152415141 |
7 | 132216140422135 |
oct | 16442370710005 |
9 | 3480818886007 |
10 | 1001061060613 |
11 | 356602964499 |
12 | 1420193a74b1 |
13 | 73527064663 |
14 | 3664732aac5 |
15 | 1b08e9a995d |
hex | e913e39005 |
1001061060613 has 2 divisors, whose sum is σ = 1001061060614. Its totient is φ = 1001061060612.
The previous prime is 1001061060611. The next prime is 1001061060677. The reversal of 1001061060613 is 3160601601001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 742247725444 + 258813335169 = 861538^2 + 508737^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001061060613 - 21 = 1001061060611 is a prime.
Together with 1001061060611, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1001061060611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500530530306 + 500530530307.
It is an arithmetic number, because the mean of its divisors is an integer number (500530530307).
Almost surely, 21001061060613 is an apocalyptic number.
It is an amenable number.
1001061060613 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001061060613 is an equidigital number, since it uses as much as digits as its factorization.
1001061060613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 25.
Adding to 1001061060613 its reverse (3160601601001), we get a palindrome (4161662661614).
The spelling of 1001061060613 in words is "one trillion, one billion, sixty-one million, sixty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •