Base | Representation |
---|---|
bin | 110000000100100000… |
… | …000110001111101010 |
3 | 11221020010222022021210 |
4 | 300010200012033222 |
5 | 1321201433134402 |
6 | 35413415213550 |
7 | 3505033241220 |
oct | 600440061752 |
9 | 157203868253 |
10 | 51615130602 |
11 | 1a987439632 |
12 | a0059772b6 |
13 | 4b375726c9 |
14 | 26d9042b10 |
15 | 152158206c |
hex | c048063ea |
51615130602 has 32 divisors (see below), whose sum is σ = 119911503744. Its totient is φ = 14505422400.
The previous prime is 51615130591. The next prime is 51615130613. The reversal of 51615130602 is 20603151615.
It is an interprime number because it is at equal distance from previous prime (51615130591) and next prime (51615130613).
It is a self number, because there is not a number n which added to its sum of digits gives 51615130602.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10070649 + ... + 10075772.
It is an arithmetic number, because the mean of its divisors is an integer number (3747234492).
Almost surely, 251615130602 is an apocalyptic number.
51615130602 is an abundant number, since it is smaller than the sum of its proper divisors (68296373142).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51615130602 is a wasteful number, since it uses less digits than its factorization.
51615130602 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20146494.
The product of its (nonzero) digits is 5400, while the sum is 30.
The spelling of 51615130602 in words is "fifty-one billion, six hundred fifteen million, one hundred thirty thousand, six hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •