Base | Representation |
---|---|
bin | 1100001101100000… |
… | …11000111001110111 |
3 | 121220212220002210021 |
4 | 12012300120321313 |
5 | 101411241033114 |
6 | 3002305310011 |
7 | 321313242040 |
oct | 60660307167 |
9 | 17825802707 |
10 | 6555799159 |
11 | 2864639a38 |
12 | 132b635307 |
13 | 806289a00 |
14 | 46296b8c7 |
15 | 285824024 |
hex | 186c18e77 |
6555799159 has 48 divisors (see below), whose sum is σ = 8580211200. Its totient is φ = 4890907008.
The previous prime is 6555799153. The next prime is 6555799163. The reversal of 6555799159 is 9519975556.
It is not a de Polignac number, because 6555799159 - 225 = 6522244727 is a prime.
It is a super-2 number, since 2×65557991592 = 85957005226290214562, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6555799097 and 6555799106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6555799153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5910897 + ... + 5912005.
It is an arithmetic number, because the mean of its divisors is an integer number (178754400).
Almost surely, 26555799159 is an apocalyptic number.
6555799159 is a deficient number, since it is larger than the sum of its proper divisors (2024412041).
6555799159 is a wasteful number, since it uses less digits than its factorization.
6555799159 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1424 (or 1411 counting only the distinct ones).
The product of its digits is 19136250, while the sum is 61.
The square root of 6555799159 is about 80967.8896785633. The cubic root of 6555799159 is about 1871.5806513100.
The spelling of 6555799159 in words is "six billion, five hundred fifty-five million, seven hundred ninety-nine thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •