Base | Representation |
---|---|
bin | 11001000110001001110111… |
… | …10110010101110000001011 |
3 | 21020101211101121221022102101 |
4 | 30203010323312111300023 |
5 | 24213141023423340143 |
6 | 313212324202214231 |
7 | 14424063161453506 |
oct | 1443047366256013 |
9 | 236354347838371 |
10 | 55187038886923 |
11 | 16647767801749 |
12 | 623374b7b4377 |
13 | 24a41667cb718 |
14 | d8b0d194a13d |
15 | 65a81c9d5b4d |
hex | 32313bd95c0b |
55187038886923 has 2 divisors, whose sum is σ = 55187038886924. Its totient is φ = 55187038886922.
The previous prime is 55187038886729. The next prime is 55187038886929. The reversal of 55187038886923 is 32968883078155.
55187038886923 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 55187038886923 - 229 = 55186502016011 is a prime.
It is a super-2 number, since 2×551870388869232 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (55187038886929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27593519443461 + 27593519443462.
It is an arithmetic number, because the mean of its divisors is an integer number (27593519443462).
Almost surely, 255187038886923 is an apocalyptic number.
55187038886923 is a deficient number, since it is larger than the sum of its proper divisors (1).
55187038886923 is an equidigital number, since it uses as much as digits as its factorization.
55187038886923 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 696729600, while the sum is 73.
The spelling of 55187038886923 in words is "fifty-five trillion, one hundred eighty-seven billion, thirty-eight million, eight hundred eighty-six thousand, nine hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •