Base | Representation |
---|---|
bin | 101111111111100101… |
… | …001011001111001010 |
3 | 11221000101122002020110 |
4 | 233333211023033022 |
5 | 1321014314410230 |
6 | 35401305535150 |
7 | 3503011444311 |
oct | 577745131712 |
9 | 157011562213 |
10 | 51532575690 |
11 | 1a944882932 |
12 | 9ba21a44b6 |
13 | 4b2342944b |
14 | 26cc0b3278 |
15 | 15191c64b0 |
hex | bff94b3ca |
51532575690 has 64 divisors (see below), whose sum is σ = 127058803200. Its totient is φ = 13368322560.
The previous prime is 51532575683. The next prime is 51532575719. The reversal of 51532575690 is 9657523515.
It is a happy number.
It is a super-2 number, since 2×515325756902 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
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 in 31 ways as a sum of consecutive naturals, for example, 369247 + ... + 489293.
It is an arithmetic number, because the mean of its divisors is an integer number (1985293800).
Almost surely, 251532575690 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51532575690, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63529401600).
51532575690 is an abundant number, since it is smaller than the sum of its proper divisors (75526227510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51532575690 is a wasteful number, since it uses less digits than its factorization.
51532575690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120447.
The product of its (nonzero) digits is 1417500, while the sum is 48.
The spelling of 51532575690 in words is "fifty-one billion, five hundred thirty-two million, five hundred seventy-five thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •