Base | Representation |
---|---|
bin | 1011101101001… |
… | …1111011000111 |
3 | 10102101200000102 |
4 | 2323103323013 |
5 | 100032240120 |
6 | 4512234315 |
7 | 1134236036 |
oct | 273237307 |
9 | 112350012 |
10 | 49102535 |
11 | 25798509 |
12 | 1453b99b |
13 | a232a71 |
14 | 674271d |
15 | 449dd75 |
hex | 2ed3ec7 |
49102535 has 16 divisors (see below), whose sum is σ = 60201792. Its totient is φ = 38438400.
The previous prime is 49102531. The next prime is 49102541. The reversal of 49102535 is 53520194.
It is not a de Polignac number, because 49102535 - 22 = 49102531 is a prime.
It is a super-2 number, since 2×491025352 = 4822117886852450, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 49102498 and 49102507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49102531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 55295 + ... + 56175.
It is an arithmetic number, because the mean of its divisors is an integer number (3762612).
Almost surely, 249102535 is an apocalyptic number.
49102535 is a deficient number, since it is larger than the sum of its proper divisors (11099257).
49102535 is a wasteful number, since it uses less digits than its factorization.
49102535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1114.
The product of its (nonzero) digits is 5400, while the sum is 29.
The square root of 49102535 is about 7007.3201011514. The cubic root of 49102535 is about 366.1856359694.
The spelling of 49102535 in words is "forty-nine million, one hundred two thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •