Base | Representation |
---|---|
bin | 10110010011001111011111… |
… | …00110011111101001010111 |
3 | 20102122010221022202222021112 |
4 | 23021213233212133221113 |
5 | 22411431211313323101 |
6 | 252144302013405235 |
7 | 13220666345513651 |
oct | 1311475746375127 |
9 | 212563838688245 |
10 | 49039661464151 |
11 | 14697670487246 |
12 | 560026b49981b |
13 | 2149560338927 |
14 | c177648076d1 |
15 | 5a097a30d6bb |
hex | 2c99ef99fa57 |
49039661464151 has 2 divisors, whose sum is σ = 49039661464152. Its totient is φ = 49039661464150.
The previous prime is 49039661464133. The next prime is 49039661464249. The reversal of 49039661464151 is 15146416693094.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-49039661464151 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49039661464051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24519830732075 + 24519830732076.
It is an arithmetic number, because the mean of its divisors is an integer number (24519830732076).
Almost surely, 249039661464151 is an apocalyptic number.
49039661464151 is a deficient number, since it is larger than the sum of its proper divisors (1).
49039661464151 is an equidigital number, since it uses as much as digits as its factorization.
49039661464151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16796160, while the sum is 59.
The spelling of 49039661464151 in words is "forty-nine trillion, thirty-nine billion, six hundred sixty-one million, four hundred sixty-four thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •