Base | Representation |
---|---|
bin | 101111111111110010… |
… | …110000100000000011 |
3 | 11221000122022222100000 |
4 | 233333302300200003 |
5 | 1321021222324240 |
6 | 35401514131043 |
7 | 3503053633635 |
oct | 577762604003 |
9 | 157018288300 |
10 | 51536136195 |
11 | 1a9468949a5 |
12 | 9ba3420a83 |
13 | 4b240a4c5b |
14 | 26cc75ca55 |
15 | 151967b430 |
hex | bffcb0803 |
51536136195 has 24 divisors (see below), whose sum is σ = 92637797616. Its totient is φ = 27485938656.
The previous prime is 51536136187. The next prime is 51536136203. The reversal of 51536136195 is 59163163515.
51536136195 is a `hidden beast` number, since 5 + 15 + 3 + 6 + 13 + 619 + 5 = 666.
It is an interprime number because it is at equal distance from previous prime (51536136187) and next prime (51536136203).
It is not a de Polignac number, because 51536136195 - 23 = 51536136187 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 51536136195.
It is an unprimeable number.
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 in 23 ways as a sum of consecutive naturals, for example, 21207072 + ... + 21209501.
It is an arithmetic number, because the mean of its divisors is an integer number (3859908234).
Almost surely, 251536136195 is an apocalyptic number.
51536136195 is a deficient number, since it is larger than the sum of its proper divisors (41101661421).
51536136195 is an equidigital number, since it uses as much as digits as its factorization.
51536136195 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42416593 (or 42416581 counting only the distinct ones).
The product of its digits is 364500, while the sum is 45.
The spelling of 51536136195 in words is "fifty-one billion, five hundred thirty-six million, one hundred thirty-six thousand, one hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •