Base | Representation |
---|---|
bin | 101000000001001010011… |
… | …0110110111101001000101 |
3 | 201110210121022212002122212 |
4 | 1100002110312313221011 |
5 | 1210103103210104113 |
6 | 15410405102233205 |
7 | 1105236334544435 |
oct | 120022466675105 |
9 | 21423538762585 |
10 | 5500055550533 |
11 | 1830618a76995 |
12 | 749b45585805 |
13 | 30b86489197b |
14 | 1502c010a2c5 |
15 | 981081790a8 |
hex | 50094db7a45 |
5500055550533 has 2 divisors, whose sum is σ = 5500055550534. Its totient is φ = 5500055550532.
The previous prime is 5500055550527. The next prime is 5500055550677. The reversal of 5500055550533 is 3350555500055.
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., 3702399402244 + 1797656148289 = 1924162^2 + 1340767^2 .
It is a cyclic number.
It is not a de Polignac number, because 5500055550533 - 28 = 5500055550277 is a prime.
It is a super-2 number, since 2×55000555505332 (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 (5500055550433) 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, 2750027775266 + 2750027775267.
It is an arithmetic number, because the mean of its divisors is an integer number (2750027775267).
Almost surely, 25500055550533 is an apocalyptic number.
It is an amenable number.
5500055550533 is a deficient number, since it is larger than the sum of its proper divisors (1).
5500055550533 is an equidigital number, since it uses as much as digits as its factorization.
5500055550533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 703125, while the sum is 41.
The spelling of 5500055550533 in words is "five trillion, five hundred billion, fifty-five million, five hundred fifty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.168 sec. • engine limits •