Base | Representation |
---|---|
bin | 101000011010110000000… |
… | …0110011000110011010001 |
3 | 201200001102211221101210202 |
4 | 1100311200012120303101 |
5 | 1212003122240012123 |
6 | 15451533431504545 |
7 | 1112223126300614 |
oct | 120654006306321 |
9 | 21601384841722 |
10 | 5555005000913 |
11 | 18519565602a5 |
12 | 75871bb28155 |
13 | 313ab0b71954 |
14 | 152c13d0017b |
15 | 997722dca28 |
hex | 50d60198cd1 |
5555005000913 has 2 divisors, whose sum is σ = 5555005000914. Its totient is φ = 5555005000912.
The previous prime is 5555005000877. The next prime is 5555005000927. The reversal of 5555005000913 is 3190005005555.
5555005000913 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5530290645649 + 24714355264 = 2351657^2 + 157208^2 .
It is a cyclic number.
It is not a de Polignac number, because 5555005000913 - 216 = 5555004935377 is a prime.
It is not a weakly prime, because it can be changed into another prime (5555005000613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2777502500456 + 2777502500457.
It is an arithmetic number, because the mean of its divisors is an integer number (2777502500457).
Almost surely, 25555005000913 is an apocalyptic number.
It is an amenable number.
5555005000913 is a deficient number, since it is larger than the sum of its proper divisors (1).
5555005000913 is an equidigital number, since it uses as much as digits as its factorization.
5555005000913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84375, while the sum is 38.
The spelling of 5555005000913 in words is "five trillion, five hundred fifty-five billion, five million, nine hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •