Base | Representation |
---|---|
bin | 101110001110010100… |
… | …011000111000011001 |
3 | 11202002222000121020212 |
4 | 232032110120320121 |
5 | 1303121340142341 |
6 | 34444545300505 |
7 | 3404636004023 |
oct | 561624307031 |
9 | 152088017225 |
10 | 49632349721 |
11 | 1a05a192a49 |
12 | 9751934735 |
13 | 48ac846a96 |
14 | 258b98b013 |
15 | 14574715eb |
hex | b8e518e19 |
49632349721 has 4 divisors (see below), whose sum is σ = 49639272372. Its totient is φ = 49625427072.
The previous prime is 49632349717. The next prime is 49632349751. The reversal of 49632349721 is 12794323694.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 47639173696 + 1993176025 = 218264^2 + 44645^2 .
It is a cyclic number.
It is not a de Polignac number, because 49632349721 - 22 = 49632349717 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 49632349721.
It is not an unprimeable number, because it can be changed into a prime (49632349751) 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, 3450560 + ... + 3464913.
It is an arithmetic number, because the mean of its divisors is an integer number (12409818093).
Almost surely, 249632349721 is an apocalyptic number.
It is an amenable number.
49632349721 is a deficient number, since it is larger than the sum of its proper divisors (6922651).
49632349721 is an equidigital number, since it uses as much as digits as its factorization.
49632349721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6922650.
The product of its digits is 1959552, while the sum is 50.
The spelling of 49632349721 in words is "forty-nine billion, six hundred thirty-two million, three hundred forty-nine thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •