Base | Representation |
---|---|
bin | 110011111110000111… |
… | …011000101000000111 |
3 | 12100001000002220011002 |
4 | 303332013120220013 |
5 | 1403241024100140 |
6 | 41345135003515 |
7 | 4013564205452 |
oct | 637607305007 |
9 | 170030086132 |
10 | 55802956295 |
11 | 2173634aaa9 |
12 | a99436959b |
13 | 5354077c88 |
14 | 29b52ca499 |
15 | 16b9059415 |
hex | cfe1d8a07 |
55802956295 has 8 divisors (see below), whose sum is σ = 67010482224. Its totient is φ = 44611075264.
The previous prime is 55802956291. The next prime is 55802956337. The reversal of 55802956295 is 59265920855.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 55802956295 - 22 = 55802956291 is a prime.
It is a super-2 number, since 2×558029562952 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 55802956295.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55802956291) 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 in 7 ways as a sum of consecutive naturals, for example, 3903374 + ... + 3917643.
It is an arithmetic number, because the mean of its divisors is an integer number (8376310278).
Almost surely, 255802956295 is an apocalyptic number.
55802956295 is a deficient number, since it is larger than the sum of its proper divisors (11207525929).
55802956295 is a wasteful number, since it uses less digits than its factorization.
55802956295 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7822449.
The product of its (nonzero) digits is 9720000, while the sum is 56.
The spelling of 55802956295 in words is "fifty-five billion, eight hundred two million, nine hundred fifty-six thousand, two hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •