Base | Representation |
---|---|
bin | 110011100010011101… |
… | …100101100011100011 |
3 | 12021211200010012110212 |
4 | 303202131211203203 |
5 | 1401313241424441 |
6 | 41231123044335 |
7 | 3666231601214 |
oct | 634235454343 |
9 | 167750105425 |
10 | 55339014371 |
11 | 21518481623 |
12 | a884b106ab |
13 | 52abc09424 |
14 | 296d83d40b |
15 | 168d464eeb |
hex | ce27658e3 |
55339014371 has 2 divisors, whose sum is σ = 55339014372. Its totient is φ = 55339014370.
The previous prime is 55339014347. The next prime is 55339014373. The reversal of 55339014371 is 17341093355.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 55339014371 - 210 = 55339013347 is a prime.
Together with 55339014373, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (55339014373) 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, 27669507185 + 27669507186.
It is an arithmetic number, because the mean of its divisors is an integer number (27669507186).
Almost surely, 255339014371 is an apocalyptic number.
55339014371 is a deficient number, since it is larger than the sum of its proper divisors (1).
55339014371 is an equidigital number, since it uses as much as digits as its factorization.
55339014371 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 170100, while the sum is 41.
The spelling of 55339014371 in words is "fifty-five billion, three hundred thirty-nine million, fourteen thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •