Base | Representation |
---|---|
bin | 11001000000101101011111… |
… | …10100101101100001000001 |
3 | 21012201221121222200001211101 |
4 | 30200112233310231201001 |
5 | 24202110003022243001 |
6 | 312550353131414401 |
7 | 14404422264565246 |
oct | 1440265764554101 |
9 | 235657558601741 |
10 | 55000006056001 |
11 | 1658540a631606 |
12 | 62034528b4401 |
13 | 248c62ab27876 |
14 | d8202bac95cd |
15 | 655a22b7aa01 |
hex | 3205afd2d841 |
55000006056001 has 16 divisors (see below), whose sum is σ = 56000019675600. Its totient is φ = 54003179243520.
The previous prime is 55000006055993. The next prime is 55000006056071. The reversal of 55000006056001 is 10065060000055.
It can be written as a sum of positive squares in 8 ways, for example, as 71156096001 + 54928849960000 = 266751^2 + 7411400^2 .
It is a cyclic number.
It is not a de Polignac number, because 55000006056001 - 23 = 55000006055993 is a prime.
It is a super-2 number, since 2×550000060560012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55000006056071) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 575573175 + ... + 575668723.
It is an arithmetic number, because the mean of its divisors is an integer number (3500001229725).
Almost surely, 255000006056001 is an apocalyptic number.
It is an amenable number.
55000006056001 is a deficient number, since it is larger than the sum of its proper divisors (1000013619599).
55000006056001 is a wasteful number, since it uses less digits than its factorization.
55000006056001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112116.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 55000006056001 its reverse (10065060000055), we get a palindrome (65065066056056).
The spelling of 55000006056001 in words is "fifty-five trillion, six million, fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •