Base | Representation |
---|---|
bin | 11101010011000011010… |
… | …00111000111111100101 |
3 | 10120020100220020200001012 |
4 | 32221201220320333211 |
5 | 112443120034101141 |
6 | 2050241535112005 |
7 | 132504661461224 |
oct | 16514150707745 |
9 | 3506326220035 |
10 | 1006660456421 |
11 | 358a16647434 |
12 | 143120672605 |
13 | 73c0a139b09 |
14 | 36a18c58cbb |
15 | 1b2bb35eceb |
hex | ea61a38fe5 |
1006660456421 has 2 divisors, whose sum is σ = 1006660456422. Its totient is φ = 1006660456420.
The previous prime is 1006660456409. The next prime is 1006660456433. The reversal of 1006660456421 is 1246540666001.
It is a balanced prime because it is at equal distance from previous prime (1006660456409) and next prime (1006660456433).
It can be written as a sum of positive squares in only one way, i.e., 569096728225 + 437563728196 = 754385^2 + 661486^2 .
It is an emirp because it is prime and its reverse (1246540666001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1006660456421 - 218 = 1006660194277 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1006660456471) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 503330228210 + 503330228211.
It is an arithmetic number, because the mean of its divisors is an integer number (503330228211).
Almost surely, 21006660456421 is an apocalyptic number.
It is an amenable number.
1006660456421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1006660456421 is an equidigital number, since it uses as much as digits as its factorization.
1006660456421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 207360, while the sum is 41.
The spelling of 1006660456421 in words is "one trillion, six billion, six hundred sixty million, four hundred fifty-six thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •