Base | Representation |
---|---|
bin | 111000110110110111… |
… | …110110000011110111 |
3 | 12211120200122000022121 |
4 | 320312313312003313 |
5 | 2000012314314114 |
6 | 44013540340411 |
7 | 4260610502614 |
oct | 706667660367 |
9 | 184520560277 |
10 | 61050151159 |
11 | 23989245188 |
12 | b9b96a4707 |
13 | 59ac1a64ca |
14 | 2d5213750b |
15 | 18c4a3da24 |
hex | e36df60f7 |
61050151159 has 2 divisors, whose sum is σ = 61050151160. Its totient is φ = 61050151158.
The previous prime is 61050151111. The next prime is 61050151181. The reversal of 61050151159 is 95115105016.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 61050151159 - 27 = 61050151031 is a prime.
It is a super-3 number, since 3×610501511593 (a number of 33 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (61050131159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30525075579 + 30525075580.
It is an arithmetic number, because the mean of its divisors is an integer number (30525075580).
Almost surely, 261050151159 is an apocalyptic number.
61050151159 is a deficient number, since it is larger than the sum of its proper divisors (1).
61050151159 is an equidigital number, since it uses as much as digits as its factorization.
61050151159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6750, while the sum is 34.
The spelling of 61050151159 in words is "sixty-one billion, fifty million, one hundred fifty-one thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •