Search a number
-
+
48591467001 = 3371123372519
BaseRepresentation
bin101101010000010001…
…101111000111111001
311122102102102021121000
4231100101233013321
51244003403421001
634153403435213
73340066440360
oct552021570771
9148372367530
1048591467001
11196756863a0
129501225b09
134774cc434c
1424cd63a7d7
1513e5db6a86
hexb5046f1f9

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".

Divisors: 1 3 7 9 11 21 27 33 63 77 99 189 231 297 693 2079 23372519 70117557 163607633 210352671 257097709 490822899 631058013 771293127 1472468697 1799683963 2313879381 4417406091 5399051889 6941638143 16197155667 48591467001