Base | Representation |
---|---|
bin | 101101101011110110… |
… | …110011111110000101 |
3 | 11200121200002002011122 |
4 | 231223312303332011 |
5 | 1300430331433023 |
6 | 34311333043325 |
7 | 3354415400561 |
oct | 555366637605 |
9 | 150550062148 |
10 | 49054171013 |
11 | 19892889801 |
12 | 9610186545 |
13 | 4819b1b5c3 |
14 | 2534c846a1 |
15 | 14218142c8 |
hex | b6bdb3f85 |
49054171013 has 2 divisors, whose sum is σ = 49054171014. Its totient is φ = 49054171012.
The previous prime is 49054170937. The next prime is 49054171021. The reversal of 49054171013 is 31017145094.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 33574332289 + 15479838724 = 183233^2 + 124418^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-49054171013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49054171813) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24527085506 + 24527085507.
It is an arithmetic number, because the mean of its divisors is an integer number (24527085507).
Almost surely, 249054171013 is an apocalyptic number.
It is an amenable number.
49054171013 is a deficient number, since it is larger than the sum of its proper divisors (1).
49054171013 is an equidigital number, since it uses as much as digits as its factorization.
49054171013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 35.
The spelling of 49054171013 in words is "forty-nine billion, fifty-four million, one hundred seventy-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •