Base | Representation |
---|---|
bin | 101110010001011001… |
… | …111011001000010001 |
3 | 11202020120110102200201 |
4 | 232101121323020101 |
5 | 1303223114213434 |
6 | 34454035215201 |
7 | 3406135104604 |
oct | 562131731021 |
9 | 152216412621 |
10 | 49684132369 |
11 | 1a086441023 |
12 | 9767147501 |
13 | 48ba4a76c1 |
14 | 25947ca33b |
15 | 145bc9e614 |
hex | b9167b211 |
49684132369 has 4 divisors (see below), whose sum is σ = 50364736996. Its totient is φ = 49003527744.
The previous prime is 49684132367. The next prime is 49684132373. The reversal of 49684132369 is 96323148694.
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 30331705600 + 19352426769 = 174160^2 + 139113^2 .
It is a cyclic number.
It is not a de Polignac number, because 49684132369 - 21 = 49684132367 is a prime.
It is a super-2 number, since 2×496841323692 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (49684132367) 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, 340302204 + ... + 340302349.
It is an arithmetic number, because the mean of its divisors is an integer number (12591184249).
Almost surely, 249684132369 is an apocalyptic number.
It is an amenable number.
49684132369 is a deficient number, since it is larger than the sum of its proper divisors (680604627).
49684132369 is an equidigital number, since it uses as much as digits as its factorization.
49684132369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 680604626.
The product of its digits is 6718464, while the sum is 55.
The spelling of 49684132369 in words is "forty-nine billion, six hundred eighty-four million, one hundred thirty-two thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •