Base | Representation |
---|---|
bin | 1011100011010… |
… | …1000101000001 |
3 | 10101011121112000 |
4 | 2320311011001 |
5 | 44400430110 |
6 | 4450254213 |
7 | 1125556125 |
oct | 270650501 |
9 | 111147460 |
10 | 48451905 |
11 | 253936a7 |
12 | 14287369 |
13 | a065888 |
14 | 6613585 |
15 | 43c11c0 |
hex | 2e35141 |
48451905 has 16 divisors (see below), whose sum is σ = 86136960. Its totient is φ = 25840944.
The previous prime is 48451901. The next prime is 48451951. The reversal of 48451905 is 50915484.
It is not a de Polignac number, because 48451905 - 22 = 48451901 is a prime.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 48451905.
It is not an unprimeable number, because it can be changed into a prime (48451901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 179317 + ... + 179586.
It is an arithmetic number, because the mean of its divisors is an integer number (5383560).
Almost surely, 248451905 is an apocalyptic number.
48451905 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
48451905 is a deficient number, since it is larger than the sum of its proper divisors (37685055).
48451905 is a wasteful number, since it uses less digits than its factorization.
48451905 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 358917 (or 358911 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 36.
The square root of 48451905 is about 6960.7402623572. The cubic root of 48451905 is about 364.5610661629.
The spelling of 48451905 in words is "forty-eight million, four hundred fifty-one thousand, nine hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •