Base | Representation |
---|---|
bin | 1011101011110… |
… | …1101000011111 |
3 | 10102020000202210 |
4 | 2322331220133 |
5 | 100021324411 |
6 | 4510251503 |
7 | 1133405613 |
oct | 272755037 |
9 | 112200683 |
10 | 49011231 |
11 | 25735955 |
12 | 144b6b93 |
13 | a200339 |
14 | 671b343 |
15 | 4481ca6 |
hex | 2ebda1f |
49011231 has 4 divisors (see below), whose sum is σ = 65348312. Its totient is φ = 32674152.
The previous prime is 49011227. The next prime is 49011233. The reversal of 49011231 is 13211094.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 49011231 - 22 = 49011227 is a prime.
It is a super-2 number, since 2×490112312 = 4804201528270722, 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 = 49011198 and 49011207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49011233) 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 3 ways as a sum of consecutive naturals, for example, 8168536 + ... + 8168541.
It is an arithmetic number, because the mean of its divisors is an integer number (16337078).
Almost surely, 249011231 is an apocalyptic number.
49011231 is a deficient number, since it is larger than the sum of its proper divisors (16337081).
49011231 is a wasteful number, since it uses less digits than its factorization.
49011231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16337080.
The product of its (nonzero) digits is 216, while the sum is 21.
The square root of 49011231 is about 7000.8021683233. The cubic root of 49011231 is about 365.9585264601.
The spelling of 49011231 in words is "forty-nine million, eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •