Base | Representation |
---|---|
bin | 11001001000000101000000… |
… | …11111111101111000110011 |
3 | 21020122011001011110222022202 |
4 | 30210002200133331320303 |
5 | 24220231423404432014 |
6 | 313302540404253415 |
7 | 14431623421062521 |
oct | 1444024037757063 |
9 | 236564034428282 |
10 | 55253152030259 |
11 | 16672803968887 |
12 | 62445209a126b |
13 | 24aa4718ba691 |
14 | d903a4261311 |
15 | 65c3dbc703de |
hex | 3240a07fde33 |
55253152030259 has 2 divisors, whose sum is σ = 55253152030260. Its totient is φ = 55253152030258.
The previous prime is 55253152030199. The next prime is 55253152030313. The reversal of 55253152030259 is 95203025135255.
55253152030259 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 55253152030259 - 232 = 55248857062963 is a prime.
It is a super-4 number, since 4×552531520302594 (a number of 56 digits) contains 4444 as substring.
It is not a weakly prime, because it can be changed into another prime (55253152033259) 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, 27626576015129 + 27626576015130.
It is an arithmetic number, because the mean of its divisors is an integer number (27626576015130).
Almost surely, 255253152030259 is an apocalyptic number.
55253152030259 is a deficient number, since it is larger than the sum of its proper divisors (1).
55253152030259 is an equidigital number, since it uses as much as digits as its factorization.
55253152030259 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2025000, while the sum is 47.
The spelling of 55253152030259 in words is "fifty-five trillion, two hundred fifty-three billion, one hundred fifty-two million, thirty thousand, two hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •