Base | Representation |
---|---|
bin | 10110100000000111001001… |
… | …11010000101010111101001 |
3 | 20111012102100011021010001211 |
4 | 23100003210322011113221 |
5 | 22441202324100302023 |
6 | 253123353201513121 |
7 | 13264642465401364 |
oct | 1320034472052751 |
9 | 214172304233054 |
10 | 49481863681513 |
11 | 1484816007112a |
12 | 5671b000427a1 |
13 | 217c173056203 |
14 | c30d138310db |
15 | 5ac20bbe7a0d |
hex | 2d00e4e855e9 |
49481863681513 has 2 divisors, whose sum is σ = 49481863681514. Its totient is φ = 49481863681512.
The previous prime is 49481863681483. The next prime is 49481863681519. The reversal of 49481863681513 is 31518636818494.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31058908594704 + 18422955086809 = 5573052^2 + 4292197^2 .
It is a cyclic number.
It is not a de Polignac number, because 49481863681513 - 29 = 49481863681001 is a prime.
It is not a weakly prime, because it can be changed into another prime (49481863681519) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24740931840756 + 24740931840757.
It is an arithmetic number, because the mean of its divisors is an integer number (24740931840757).
Almost surely, 249481863681513 is an apocalyptic number.
It is an amenable number.
49481863681513 is a deficient number, since it is larger than the sum of its proper divisors (1).
49481863681513 is an equidigital number, since it uses as much as digits as its factorization.
49481863681513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 119439360, while the sum is 67.
The spelling of 49481863681513 in words is "forty-nine trillion, four hundred eighty-one billion, eight hundred sixty-three million, six hundred eighty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •