Base | Representation |
---|---|
bin | 101101010000010001… |
… | …101111000111111001 |
3 | 11122102102102021121000 |
4 | 231100101233013321 |
5 | 1244003403421001 |
6 | 34153403435213 |
7 | 3340066440360 |
oct | 552021570771 |
9 | 148372367530 |
10 | 48591467001 |
11 | 196756863a0 |
12 | 9501225b09 |
13 | 4774cc434c |
14 | 24cd63a7d7 |
15 | 13e5db6a86 |
hex | b5046f1f9 |
48591467001 has 32 divisors (see below), whose sum is σ = 89750476800. Its totient is φ = 25242319440.
The previous prime is 48591466969. The next prime is 48591467003. The reversal of 48591467001 is 10076419584.
It is not a de Polignac number, because 48591467001 - 25 = 48591466969 is a prime.
It is a super-2 number, since 2×485914670012 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (48591467003) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 11684181 + ... + 11688338.
It is an arithmetic number, because the mean of its divisors is an integer number (2804702400).
Almost surely, 248591467001 is an apocalyptic number.
It is an amenable number.
48591467001 is a deficient number, since it is larger than the sum of its proper divisors (41159009799).
48591467001 is a wasteful number, since it uses less digits than its factorization.
48591467001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23372546 (or 23372540 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 45.
The spelling of 48591467001 in words is "forty-eight billion, five hundred ninety-one million, four hundred sixty-seven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •