Base | Representation |
---|---|
bin | 100100110010001110100… |
… | …1001110111000001111001 |
3 | 122220022120000211012011022 |
4 | 1021210131021313001321 |
5 | 1130313000400200403 |
6 | 14430312444112225 |
7 | 1031155051551431 |
oct | 111443511670171 |
9 | 18808500735138 |
10 | 5055665631353 |
11 | 167a1064a2277 |
12 | 6979a4235675 |
13 | 2a899385a67c |
14 | 1369a47272c1 |
15 | 8b7996a1d38 |
hex | 4991d277079 |
5055665631353 has 2 divisors, whose sum is σ = 5055665631354. Its totient is φ = 5055665631352.
The previous prime is 5055665631349. The next prime is 5055665631433. The reversal of 5055665631353 is 3531365665505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4014424981609 + 1041240649744 = 2003603^2 + 1020412^2 .
It is a cyclic number.
It is not a de Polignac number, because 5055665631353 - 22 = 5055665631349 is a prime.
It is a super-2 number, since 2×50556656313532 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5055665631295 and 5055665631304.
It is not a weakly prime, because it can be changed into another prime (5055665631343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2527832815676 + 2527832815677.
It is an arithmetic number, because the mean of its divisors is an integer number (2527832815677).
Almost surely, 25055665631353 is an apocalyptic number.
It is an amenable number.
5055665631353 is a deficient number, since it is larger than the sum of its proper divisors (1).
5055665631353 is an equidigital number, since it uses as much as digits as its factorization.
5055665631353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18225000, while the sum is 53.
The spelling of 5055665631353 in words is "five trillion, fifty-five billion, six hundred sixty-five million, six hundred thirty-one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •