Base | Representation |
---|---|
bin | 100100110010000011110… |
… | …1010001010111100000101 |
3 | 122220021121220020100201122 |
4 | 1021210013222022330011 |
5 | 1130311231040042012 |
6 | 14430213002403325 |
7 | 1031143112346212 |
oct | 111440752127405 |
9 | 18807556210648 |
10 | 5055305002757 |
11 | 1679a40978709 |
12 | 697903500545 |
13 | 2a8936c22779 |
14 | 13696c890b09 |
15 | 8b777bb8e72 |
hex | 49907a8af05 |
5055305002757 has 2 divisors, whose sum is σ = 5055305002758. Its totient is φ = 5055305002756.
The previous prime is 5055305002753. The next prime is 5055305002831. The reversal of 5055305002757 is 7572005035505.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3979550204161 + 1075754798596 = 1994881^2 + 1037186^2 .
It is a cyclic number.
It is not a de Polignac number, because 5055305002757 - 22 = 5055305002753 is a prime.
It is a super-2 number, since 2×50553050027572 (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 (5055305002753) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2527652501378 + 2527652501379.
It is an arithmetic number, because the mean of its divisors is an integer number (2527652501379).
Almost surely, 25055305002757 is an apocalyptic number.
It is an amenable number.
5055305002757 is a deficient number, since it is larger than the sum of its proper divisors (1).
5055305002757 is an equidigital number, since it uses as much as digits as its factorization.
5055305002757 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 918750, while the sum is 44.
The spelling of 5055305002757 in words is "five trillion, fifty-five billion, three hundred five million, two thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •