Base | Representation |
---|---|
bin | 11001010010001011000101… |
… | …11001111110000111001101 |
3 | 21021212022100100211211121220 |
4 | 30221011202321332013031 |
5 | 24241422310304314014 |
6 | 314130143100113553 |
7 | 14465653050550020 |
oct | 1451054271760715 |
9 | 237768310754556 |
10 | 55600011010509 |
11 | 167969177a9539 |
12 | 629b7a32358b9 |
13 | 250409b7cb224 |
14 | da30aa89d1b7 |
15 | 66643d1766a9 |
hex | 329162e7e1cd |
55600011010509 has 8 divisors (see below), whose sum is σ = 84723826301760. Its totient is φ = 31771434863136.
The previous prime is 55600011010451. The next prime is 55600011010519. The reversal of 55600011010509 is 90501011000655.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 55600011010509 - 212 = 55600011006413 is a prime.
It is a super-2 number, since 2×556000110105092 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 55600011010509.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55600011010519) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1323809785944 + ... + 1323809785985.
It is an arithmetic number, because the mean of its divisors is an integer number (10590478287720).
Almost surely, 255600011010509 is an apocalyptic number.
It is an amenable number.
55600011010509 is a deficient number, since it is larger than the sum of its proper divisors (29123815291251).
55600011010509 is a wasteful number, since it uses less digits than its factorization.
55600011010509 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2647619571939.
The product of its (nonzero) digits is 6750, while the sum is 33.
The spelling of 55600011010509 in words is "fifty-five trillion, six hundred billion, eleven million, ten thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •