Base | Representation |
---|---|
bin | 10011111010010111… |
… | …01100010001110011 |
3 | 1000121000101222001111 |
4 | 21331023230101303 |
5 | 133343134322124 |
6 | 4524435014151 |
7 | 525624534364 |
oct | 117513542163 |
9 | 30530358044 |
10 | 10690151539 |
11 | 4596348091 |
12 | 20a413a357 |
13 | 101498bc72 |
14 | 735a95b6b |
15 | 428787494 |
hex | 27d2ec473 |
10690151539 has 2 divisors, whose sum is σ = 10690151540. Its totient is φ = 10690151538.
The previous prime is 10690151503. The next prime is 10690151573. The reversal of 10690151539 is 93515109601.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10690151539 - 27 = 10690151411 is a prime.
It is a super-2 number, since 2×106901515392 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10690154539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5345075769 + 5345075770.
It is an arithmetic number, because the mean of its divisors is an integer number (5345075770).
Almost surely, 210690151539 is an apocalyptic number.
10690151539 is a deficient number, since it is larger than the sum of its proper divisors (1).
10690151539 is an equidigital number, since it uses as much as digits as its factorization.
10690151539 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36450, while the sum is 40.
The spelling of 10690151539 in words is "ten billion, six hundred ninety million, one hundred fifty-one thousand, five hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •