Base | Representation |
---|---|
bin | 110100000101001111… |
… | …110010101001000111 |
3 | 12100100100020110011122 |
4 | 310011033302221013 |
5 | 1404012141204034 |
6 | 41405051224155 |
7 | 4016546155442 |
oct | 640517625107 |
9 | 170310213148 |
10 | 55922600519 |
11 | 21797939525 |
12 | aa0844805b |
13 | 5372aa8c86 |
14 | 29c7152659 |
15 | 16c47de62e |
hex | d053f2a47 |
55922600519 has 8 divisors (see below), whose sum is σ = 56040377040. Its totient is φ = 55804928256.
The previous prime is 55922600509. The next prime is 55922600527. The reversal of 55922600519 is 91500622955.
55922600519 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 55922600519 - 212 = 55922596423 is a prime.
It is a super-2 number, since 2×559226005192 (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 55922600519.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55922600509) 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, 1098344 + ... + 1148130.
It is an arithmetic number, because the mean of its divisors is an integer number (7005047130).
Almost surely, 255922600519 is an apocalyptic number.
55922600519 is a deficient number, since it is larger than the sum of its proper divisors (117776521).
55922600519 is a wasteful number, since it uses less digits than its factorization.
55922600519 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52129.
The product of its (nonzero) digits is 243000, while the sum is 44.
The spelling of 55922600519 in words is "fifty-five billion, nine hundred twenty-two million, six hundred thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •