Base | Representation |
---|---|
bin | 11101001010010011… |
… | …00100111011000101 |
3 | 1111102001212120121021 |
4 | 32211021210323011 |
5 | 224030321344221 |
6 | 11105254551141 |
7 | 1062650566246 |
oct | 164511447305 |
9 | 44361776537 |
10 | 15655653061 |
11 | 6704231954 |
12 | 304b0684b1 |
13 | 162662c149 |
14 | a87336ccd |
15 | 619677041 |
hex | 3a5264ec5 |
15655653061 has 2 divisors, whose sum is σ = 15655653062. Its totient is φ = 15655653060.
The previous prime is 15655653049. The next prime is 15655653067. The reversal of 15655653061 is 16035655651.
It is a happy number.
15655653061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11823300225 + 3832352836 = 108735^2 + 61906^2 .
It is a cyclic number.
It is not a de Polignac number, because 15655653061 - 211 = 15655651013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 15655652999 and 15655653017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15655653067) 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, 7827826530 + 7827826531.
It is an arithmetic number, because the mean of its divisors is an integer number (7827826531).
Almost surely, 215655653061 is an apocalyptic number.
It is an amenable number.
15655653061 is a deficient number, since it is larger than the sum of its proper divisors (1).
15655653061 is an equidigital number, since it uses as much as digits as its factorization.
15655653061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 405000, while the sum is 43.
The spelling of 15655653061 in words is "fifteen billion, six hundred fifty-five million, six hundred fifty-three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •