Base | Representation |
---|---|
bin | 101101101110101010… |
… | …101000100010001111 |
3 | 11200201221202222211120 |
4 | 231232222220202033 |
5 | 1301024413410340 |
6 | 34320135252023 |
7 | 3355530151365 |
oct | 555652504217 |
9 | 150657688746 |
10 | 49101310095 |
11 | 19907456022 |
12 | 9623b1a013 |
13 | 4826814756 |
14 | 253b235635 |
15 | 1425a264d0 |
hex | b6eaa888f |
49101310095 has 32 divisors (see below), whose sum is σ = 80702569920. Its totient is φ = 25474176000.
The previous prime is 49101310061. The next prime is 49101310123. The reversal of 49101310095 is 59001310194.
It is not a de Polignac number, because 49101310095 - 26 = 49101310031 is a prime.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 4990641 + ... + 5000469.
It is an arithmetic number, because the mean of its divisors is an integer number (2521955310).
Almost surely, 249101310095 is an apocalyptic number.
49101310095 is a deficient number, since it is larger than the sum of its proper divisors (31601259825).
49101310095 is a wasteful number, since it uses less digits than its factorization.
49101310095 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18875.
The product of its (nonzero) digits is 4860, while the sum is 33.
Subtracting 49101310095 from its reverse (59001310194), we obtain a palindrome (9900000099).
The spelling of 49101310095 in words is "forty-nine billion, one hundred one million, three hundred ten thousand, ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •