Base | Representation |
---|---|
bin | 10110101101000100010010… |
… | …10001100111101111111111 |
3 | 20112202222022200022201211222 |
4 | 23112202021101213233333 |
5 | 23021001000223242214 |
6 | 254104052025103555 |
7 | 13342051450620254 |
oct | 1326421121475777 |
9 | 215688280281758 |
10 | 49927002946559 |
11 | 149a9a17629452 |
12 | 5724230327bbb |
13 | 21b21333b632b |
14 | c486a095542b |
15 | 5b8ab138d38e |
hex | 2d6889467bff |
49927002946559 has 4 divisors (see below), whose sum is σ = 49927045477920. Its totient is φ = 49926960415200.
The previous prime is 49927002946523. The next prime is 49927002946567. The reversal of 49927002946559 is 95564920072994.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-49927002946559 is a prime.
It is a super-2 number, since 2×499270029465592 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 49927002946492 and 49927002946501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49927002946459) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19453367 + ... + 21869784.
It is an arithmetic number, because the mean of its divisors is an integer number (12481761369480).
Almost surely, 249927002946559 is an apocalyptic number.
49927002946559 is a deficient number, since it is larger than the sum of its proper divisors (42531361).
49927002946559 is a wasteful number, since it uses less digits than its factorization.
49927002946559 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42531360.
The product of its (nonzero) digits is 440899200, while the sum is 71.
The spelling of 49927002946559 in words is "forty-nine trillion, nine hundred twenty-seven billion, two million, nine hundred forty-six thousand, five hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •