Base | Representation |
---|---|
bin | 11001010001000010100111… |
… | …01000010001001111100001 |
3 | 21021201120220120221000121102 |
4 | 30220201103220101033201 |
5 | 24240303113100200434 |
6 | 314100230022204145 |
7 | 14463104565511166 |
oct | 1450412350211741 |
9 | 237646816830542 |
10 | 55561100006369 |
11 | 1678136a52a181 |
12 | 6294143b83655 |
13 | 250050a245a19 |
14 | da1258ba806d |
15 | 6654120a007e |
hex | 328853a113e1 |
55561100006369 has 2 divisors, whose sum is σ = 55561100006370. Its totient is φ = 55561100006368.
The previous prime is 55561100006329. The next prime is 55561100006521. The reversal of 55561100006369 is 96360000116555.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 35828065779025 + 19733034227344 = 5985655^2 + 4442188^2 .
It is a cyclic number.
It is not a de Polignac number, because 55561100006369 - 212 = 55561100002273 is a prime.
It is a super-2 number, since 2×555611000063692 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (55561100006329) 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, 27780550003184 + 27780550003185.
It is an arithmetic number, because the mean of its divisors is an integer number (27780550003185).
Almost surely, 255561100006369 is an apocalyptic number.
It is an amenable number.
55561100006369 is a deficient number, since it is larger than the sum of its proper divisors (1).
55561100006369 is an equidigital number, since it uses as much as digits as its factorization.
55561100006369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 729000, while the sum is 47.
The spelling of 55561100006369 in words is "fifty-five trillion, five hundred sixty-one billion, one hundred million, six thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •