Base | Representation |
---|---|
bin | 1011110101010… |
… | …1010000001110 |
3 | 10110101120200020 |
4 | 2331111100032 |
5 | 100201213040 |
6 | 4531443010 |
7 | 1141603332 |
oct | 275252016 |
9 | 113346606 |
10 | 49632270 |
11 | 2601a506 |
12 | 14756466 |
13 | a389c0c |
14 | 683d7c2 |
15 | 4555cd0 |
hex | 2f5540e |
49632270 has 32 divisors (see below), whose sum is σ = 119311488. Its totient is φ = 13213728.
The previous prime is 49632269. The next prime is 49632283. The reversal of 49632270 is 7223694.
49632270 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 a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 27537 + ... + 29283.
It is an arithmetic number, because the mean of its divisors is an integer number (3728484).
Almost surely, 249632270 is an apocalyptic number.
49632270 is an abundant number, since it is smaller than the sum of its proper divisors (69679218).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49632270 is a wasteful number, since it uses less digits than its factorization.
49632270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2704.
The product of its (nonzero) digits is 18144, while the sum is 33.
The square root of 49632270 is about 7045.0173881971. The cubic root of 49632270 is about 367.4977740621.
The spelling of 49632270 in words is "forty-nine million, six hundred thirty-two thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •