Base | Representation |
---|---|
bin | 11001000000101110011010… |
… | …10100001111011100011011 |
3 | 21012201222220110201202021022 |
4 | 30200113031110033130123 |
5 | 24202112011210020244 |
6 | 312550514205033055 |
7 | 14404440453423452 |
oct | 1440271524173433 |
9 | 235658813652238 |
10 | 55000500860699 |
11 | 1658564396a709 |
12 | 620357055578b |
13 | 248c6a94b1004 |
14 | d820776cbb99 |
15 | 655a513196ee |
hex | 3205cd50f71b |
55000500860699 has 2 divisors, whose sum is σ = 55000500860700. Its totient is φ = 55000500860698.
The previous prime is 55000500860693. The next prime is 55000500860719. The reversal of 55000500860699 is 99606800500055.
55000500860699 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 55000500860699 - 212 = 55000500856603 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 55000500860699.
It is not a weakly prime, because it can be changed into another prime (55000500860693) 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, 27500250430349 + 27500250430350.
It is an arithmetic number, because the mean of its divisors is an integer number (27500250430350).
Almost surely, 255000500860699 is an apocalyptic number.
55000500860699 is a deficient number, since it is larger than the sum of its proper divisors (1).
55000500860699 is an equidigital number, since it uses as much as digits as its factorization.
55000500860699 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916000, while the sum is 53.
The spelling of 55000500860699 in words is "fifty-five trillion, five hundred million, eight hundred sixty thousand, six hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •