Base | Representation |
---|---|
bin | 1011101100100… |
… | …1111010000011 |
3 | 10102022120201212 |
4 | 2323021322003 |
5 | 100024432012 |
6 | 4511320335 |
7 | 1134005315 |
oct | 273117203 |
9 | 112276655 |
10 | 49061507 |
11 | 2576a700 |
12 | 145200ab |
13 | a21a1a1 |
14 | 67317b5 |
15 | 4491b22 |
hex | 2ec9e83 |
49061507 has 36 divisors (see below), whose sum is σ = 60756528. Its totient is φ = 39494400.
The previous prime is 49061503. The next prime is 49061521. The reversal of 49061507 is 70516094.
It is a happy number.
It is not a de Polignac number, because 49061507 - 22 = 49061503 is a prime.
It is a super-2 number, since 2×490615072 = 4814062938222098, which contains 22 as substring.
It is a Smith number, since the sum of its digits (32) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (49061501) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 804257 + ... + 804317.
Almost surely, 249061507 is an apocalyptic number.
49061507 is a deficient number, since it is larger than the sum of its proper divisors (11695021).
49061507 is a wasteful number, since it uses less digits than its factorization.
49061507 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140 (or 112 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 32.
The square root of 49061507 is about 7004.3919793227. The cubic root of 49061507 is about 366.0836178105.
The spelling of 49061507 in words is "forty-nine million, sixty-one thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •