Base | Representation |
---|---|
bin | 10000001011101001101… |
… | …01110111101100100001 |
3 | 1222011011100220101000021 |
4 | 20011310311313230201 |
5 | 33102202312410001 |
6 | 1103232234353441 |
7 | 55112321013355 |
oct | 10056465675441 |
9 | 1864140811007 |
10 | 556011060001 |
11 | 1a4891825931 |
12 | 8b912b8b881 |
13 | 4057c359727 |
14 | 1cca8001465 |
15 | e6e3097ba1 |
hex | 8174d77b21 |
556011060001 has 8 divisors (see below), whose sum is σ = 566645575104. Its totient is φ = 545381868720.
The previous prime is 556011059983. The next prime is 556011060013. The reversal of 556011060001 is 100060110655.
556011060001 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 556011060001 - 27 = 556011059873 is a prime.
It is a super-3 number, since 3×5560110600013 (a number of 36 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (556011060041) 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, 1119765 + ... + 1538146.
It is an arithmetic number, because the mean of its divisors is an integer number (70830696888).
Almost surely, 2556011060001 is an apocalyptic number.
It is an amenable number.
556011060001 is a deficient number, since it is larger than the sum of its proper divisors (10634515103).
556011060001 is a wasteful number, since it uses less digits than its factorization.
556011060001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2661911.
The product of its (nonzero) digits is 900, while the sum is 25.
Adding to 556011060001 its reverse (100060110655), we get a palindrome (656071170656).
The spelling of 556011060001 in words is "five hundred fifty-six billion, eleven million, sixty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •