Base | Representation |
---|---|
bin | 1011100011010… |
… | …0110010011010 |
3 | 10101011112212220 |
4 | 2320310302122 |
5 | 44400410324 |
6 | 4450244510 |
7 | 1125552504 |
oct | 270646232 |
9 | 111145786 |
10 | 48450714 |
11 | 25392814 |
12 | 14286736 |
13 | a065180 |
14 | 6612d74 |
15 | 43c0b79 |
hex | 2e34c9a |
48450714 has 64 divisors (see below), whose sum is σ = 112492800. Its totient is φ = 13777920.
The previous prime is 48450713. The next prime is 48450733. The reversal of 48450714 is 41705484.
48450714 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (48450713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 80587 + ... + 81185.
It is an arithmetic number, because the mean of its divisors is an integer number (1757700).
Almost surely, 248450714 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48450714, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56246400).
48450714 is an abundant number, since it is smaller than the sum of its proper divisors (64042086).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48450714 is a wasteful number, since it uses less digits than its factorization.
48450714 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 695.
The product of its (nonzero) digits is 17920, while the sum is 33.
The square root of 48450714 is about 6960.6547105858. The cubic root of 48450714 is about 364.5580790373.
The spelling of 48450714 in words is "forty-eight million, four hundred fifty thousand, seven hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •