Base | Representation |
---|---|
bin | 10110010100111011001100… |
… | …10001011000001111000001 |
3 | 20102211200012021201011110001 |
4 | 23022131212101120033001 |
5 | 22413403123132223241 |
6 | 252231024003240001 |
7 | 13225114332424435 |
oct | 1312354621301701 |
9 | 212750167634401 |
10 | 49097486992321 |
11 | 1470a144490449 |
12 | 560b509079001 |
13 | 2151b47431ba1 |
14 | c1a48c5869c5 |
15 | 5a2211bd8431 |
hex | 2ca7664583c1 |
49097486992321 has 4 divisors (see below), whose sum is σ = 49107403678144. Its totient is φ = 49087570306500.
The previous prime is 49097486992291. The next prime is 49097486992327. The reversal of 49097486992321 is 12329968479094.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 49097486992321 - 233 = 49088897057729 is a prime.
It is a super-2 number, since 2×490974869923212 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (49097486992327) 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, 4958335485 + ... + 4958345386.
It is an arithmetic number, because the mean of its divisors is an integer number (12276850919536).
Almost surely, 249097486992321 is an apocalyptic number.
It is an amenable number.
49097486992321 is a deficient number, since it is larger than the sum of its proper divisors (9916685823).
49097486992321 is an equidigital number, since it uses as much as digits as its factorization.
49097486992321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9916685822.
The product of its (nonzero) digits is 423263232, while the sum is 73.
The spelling of 49097486992321 in words is "forty-nine trillion, ninety-seven billion, four hundred eighty-six million, nine hundred ninety-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •