Base | Representation |
---|---|
bin | 100100101111110110010… |
… | …0010100100111100011101 |
3 | 122212211100212101021012201 |
4 | 1021133230202210330131 |
5 | 1130222014043404442 |
6 | 14424105402531501 |
7 | 1030614314452456 |
oct | 111375442447435 |
9 | 18784325337181 |
10 | 5050555059997 |
11 | 1677a23733387 |
12 | 6969b8806b91 |
13 | 2a835ab26655 |
14 | 13663bac212d |
15 | 8b59aba87b7 |
hex | 497ec8a4f1d |
5050555059997 has 2 divisors, whose sum is σ = 5050555059998. Its totient is φ = 5050555059996.
The previous prime is 5050555059983. The next prime is 5050555060003. The reversal of 5050555059997 is 7999505550505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3656103464836 + 1394451595161 = 1912094^2 + 1180869^2 .
It is a cyclic number.
It is not a de Polignac number, because 5050555059997 - 223 = 5050546671389 is a prime.
It is a super-2 number, since 2×50505550599972 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5050555059947) 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, 2525277529998 + 2525277529999.
It is an arithmetic number, because the mean of its divisors is an integer number (2525277529999).
Almost surely, 25050555059997 is an apocalyptic number.
It is an amenable number.
5050555059997 is a deficient number, since it is larger than the sum of its proper divisors (1).
5050555059997 is an equidigital number, since it uses as much as digits as its factorization.
5050555059997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 79734375, while the sum is 64.
The spelling of 5050555059997 in words is "five trillion, fifty billion, five hundred fifty-five million, fifty-nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •