Base | Representation |
---|---|
bin | 1110111110001001111… |
… | …11010110000101100011 |
3 | 1211011202211201210002112 |
4 | 13133010333112011203 |
5 | 31412000422014344 |
6 | 1032152002505535 |
7 | 52110314156516 |
oct | 7370477260543 |
9 | 1734684653075 |
10 | 514406048099 |
11 | 189181892679 |
12 | 838416652ab |
13 | 3967b9080a8 |
14 | 1ac7c5d6d7d |
15 | d5aa721c9e |
hex | 77c4fd6163 |
514406048099 has 2 divisors, whose sum is σ = 514406048100. Its totient is φ = 514406048098.
The previous prime is 514406048063. The next prime is 514406048111. The reversal of 514406048099 is 990840604415.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-514406048099 is a prime.
It is a super-2 number, since 2×5144060480992 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (514406048059) 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, 257203024049 + 257203024050.
It is an arithmetic number, because the mean of its divisors is an integer number (257203024050).
Almost surely, 2514406048099 is an apocalyptic number.
514406048099 is a deficient number, since it is larger than the sum of its proper divisors (1).
514406048099 is an equidigital number, since it uses as much as digits as its factorization.
514406048099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1244160, while the sum is 50.
The spelling of 514406048099 in words is "five hundred fourteen billion, four hundred six million, forty-eight thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •