Base | Representation |
---|---|
bin | 1011101101000… |
… | …1101000001011 |
3 | 10102101012010010 |
4 | 2323101220023 |
5 | 100031440011 |
6 | 4512123003 |
7 | 1134166443 |
oct | 273215013 |
9 | 112335103 |
10 | 49093131 |
11 | 2579143a |
12 | 14536463 |
13 | a22b6b9 |
14 | 673d123 |
15 | 449b1a6 |
hex | 2ed1a0b |
49093131 has 16 divisors (see below), whose sum is σ = 69059840. Its totient is φ = 30935520.
The previous prime is 49093103. The next prime is 49093139. The reversal of 49093131 is 13139094.
49093131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 49093131 - 26 = 49093067 is a prime.
It is a super-2 number, since 2×490931312 = 4820271022766322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (49093139) by changing a digit.
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, 37026 + ... + 38328.
It is an arithmetic number, because the mean of its divisors is an integer number (4316240).
Almost surely, 249093131 is an apocalyptic number.
49093131 is a deficient number, since it is larger than the sum of its proper divisors (19966709).
49093131 is a wasteful number, since it uses less digits than its factorization.
49093131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1986.
The product of its (nonzero) digits is 2916, while the sum is 30.
The square root of 49093131 is about 7006.6490564320. The cubic root of 49093131 is about 366.1622574779.
The spelling of 49093131 in words is "forty-nine million, ninety-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •