Base | Representation |
---|---|
bin | 11001000010001100011110… |
… | …10110111111001010101111 |
3 | 21012220211020220122122220001 |
4 | 30201012033112333022233 |
5 | 24203423422224004443 |
6 | 313030025234205131 |
7 | 14411206060505215 |
oct | 1441061726771257 |
9 | 235824226578801 |
10 | 55051001000623 |
11 | 165a4aa8985241 |
12 | 6211304a237a7 |
13 | 2494396a54704 |
14 | d846a860ccb5 |
15 | 657009a53d4d |
hex | 32118f5bf2af |
55051001000623 has 2 divisors, whose sum is σ = 55051001000624. Its totient is φ = 55051001000622.
The previous prime is 55051001000539. The next prime is 55051001000659. The reversal of 55051001000623 is 32600010015055.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 55051001000623 - 221 = 55050998903471 is a prime.
It is a super-4 number, since 4×550510010006234 (a number of 56 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 55051001000591 and 55051001000600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55051001000683) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27525500500311 + 27525500500312.
It is an arithmetic number, because the mean of its divisors is an integer number (27525500500312).
Almost surely, 255051001000623 is an apocalyptic number.
55051001000623 is a deficient number, since it is larger than the sum of its proper divisors (1).
55051001000623 is an equidigital number, since it uses as much as digits as its factorization.
55051001000623 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 55051001000623 its reverse (32600010015055), we get a palindrome (87651011015678).
The spelling of 55051001000623 in words is "fifty-five trillion, fifty-one billion, one million, six hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •