Base | Representation |
---|---|
bin | 1011101110001… |
… | …1101101111111 |
3 | 10102111221202120 |
4 | 2323203231333 |
5 | 100041322411 |
6 | 4513454023 |
7 | 1134625461 |
oct | 273435577 |
9 | 112457676 |
10 | 49167231 |
11 | 25832083 |
12 | 14571313 |
13 | a256349 |
14 | 675c131 |
15 | 44b3106 |
hex | 2ee3b7f |
49167231 has 8 divisors (see below), whose sum is σ = 69006720. Its totient is φ = 31052952.
The previous prime is 49167229. The next prime is 49167233. The reversal of 49167231 is 13276194.
It is an interprime number because it is at equal distance from previous prime (49167229) and next prime (49167233).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 49167231 - 21 = 49167229 is a prime.
It is a super-2 number, since 2×491672312 = 4834833208414722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 49167192 and 49167201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49167233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 431235 + ... + 431348.
It is an arithmetic number, because the mean of its divisors is an integer number (8625840).
Almost surely, 249167231 is an apocalyptic number.
49167231 is a deficient number, since it is larger than the sum of its proper divisors (19839489).
49167231 is a wasteful number, since it uses less digits than its factorization.
49167231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 862605.
The product of its digits is 9072, while the sum is 33.
The square root of 49167231 is about 7011.9348970167. The cubic root of 49167231 is about 366.3463903906.
The spelling of 49167231 in words is "forty-nine million, one hundred sixty-seven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •