Base | Representation |
---|---|
bin | 101101001111010101… |
… | …001101100111111110 |
3 | 11122101022120012201220 |
4 | 231033111031213332 |
5 | 1243440323214100 |
6 | 34152035414210 |
7 | 3336514540266 |
oct | 551725154776 |
9 | 148338505656 |
10 | 48575601150 |
11 | 1966772a11a |
12 | 94b7a54366 |
13 | 477192a87b |
14 | 24cb4aa7a6 |
15 | 13e47d0aa0 |
hex | b4f54d9fe |
48575601150 has 24 divisors (see below), whose sum is σ = 120467491224. Its totient is φ = 12953493600.
The previous prime is 48575601143. The next prime is 48575601161. The reversal of 48575601150 is 5110657584.
It is a Curzon number.
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 161918521 + ... + 161918820.
It is an arithmetic number, because the mean of its divisors is an integer number (5019478801).
Almost surely, 248575601150 is an apocalyptic number.
48575601150 is an abundant number, since it is smaller than the sum of its proper divisors (71891890074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48575601150 is a wasteful number, since it uses less digits than its factorization.
48575601150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 323837356 (or 323837351 counting only the distinct ones).
The product of its (nonzero) digits is 168000, while the sum is 42.
The spelling of 48575601150 in words is "forty-eight billion, five hundred seventy-five million, six hundred one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.466 sec. • engine limits •