Base | Representation |
---|---|
bin | 1011100011010… |
… | …0110010001101 |
3 | 10101011112212102 |
4 | 2320310302031 |
5 | 44400410301 |
6 | 4450244445 |
7 | 1125552455 |
oct | 270646215 |
9 | 111145772 |
10 | 48450701 |
11 | 25392802 |
12 | 14286725 |
13 | a065170 |
14 | 6612d65 |
15 | 43c0b6b |
hex | 2e34c8d |
48450701 has 4 divisors (see below), whose sum is σ = 52177692. Its totient is φ = 44723712.
The previous prime is 48450679. The next prime is 48450713. The reversal of 48450701 is 10705484.
48450701 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 25745476 + 22705225 = 5074^2 + 4765^2 .
It is a cyclic number.
It is not a de Polignac number, because 48450701 - 214 = 48434317 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48450751) 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 3 ways as a sum of consecutive naturals, for example, 1863476 + ... + 1863501.
It is an arithmetic number, because the mean of its divisors is an integer number (13044423).
Almost surely, 248450701 is an apocalyptic number.
It is an amenable number.
48450701 is a deficient number, since it is larger than the sum of its proper divisors (3726991).
48450701 is a wasteful number, since it uses less digits than its factorization.
48450701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3726990.
The product of its (nonzero) digits is 4480, while the sum is 29.
The square root of 48450701 is about 6960.6537767655. The cubic root of 48450701 is about 364.5580464319.
The spelling of 48450701 in words is "forty-eight million, four hundred fifty thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •