Base | Representation |
---|---|
bin | 101000000011101110001… |
… | …0110100010001110011101 |
3 | 201111022210020122002211021 |
4 | 1100013130112202032131 |
5 | 1210200331300013203 |
6 | 15413114215324141 |
7 | 1105522442603554 |
oct | 120073426421635 |
9 | 21438706562737 |
10 | 5505550001053 |
11 | 183298849a993 |
12 | 74b019680651 |
13 | 30c22bcb171b |
14 | 150681b1ad9b |
15 | 9832a6ee5bd |
hex | 501dc5a239d |
5505550001053 has 2 divisors, whose sum is σ = 5505550001054. Its totient is φ = 5505550001052.
The previous prime is 5505550000997. The next prime is 5505550001087. The reversal of 5505550001053 is 3501000555055.
It is an a-pointer prime, because the next prime (5505550001087) can be obtained adding 5505550001053 to its sum of digits (34).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4061462304249 + 1444087696804 = 2015307^2 + 1201702^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5505550001053 is a prime.
It is a super-2 number, since 2×55055500010532 (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 (5505550001453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2752775000526 + 2752775000527.
It is an arithmetic number, because the mean of its divisors is an integer number (2752775000527).
Almost surely, 25505550001053 is an apocalyptic number.
It is an amenable number.
5505550001053 is a deficient number, since it is larger than the sum of its proper divisors (1).
5505550001053 is an equidigital number, since it uses as much as digits as its factorization.
5505550001053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 46875, while the sum is 34.
The spelling of 5505550001053 in words is "five trillion, five hundred five billion, five hundred fifty million, one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •