Base | Representation |
---|---|
bin | 101000000011101101000… |
… | …0001111100101100010001 |
3 | 201111022200112100012000201 |
4 | 1100013122001330230101 |
5 | 1210200241312100001 |
6 | 15413110304415201 |
7 | 1105521460534624 |
oct | 120073201745421 |
9 | 21438615305021 |
10 | 5505511050001 |
11 | 1832968506436 |
12 | 74b008617501 |
13 | 30c223bc4471 |
14 | 15067a89bdbb |
15 | 983270a8501 |
hex | 501da07cb11 |
5505511050001 has 8 divisors (see below), whose sum is σ = 5526054916200. Its totient is φ = 5484967756800.
The previous prime is 5505511049959. The next prime is 5505511050029. The reversal of 5505511050001 is 1000501155055.
It can be written as a sum of positive squares in 4 ways, for example, as 245345864976 + 5260165185025 = 495324^2 + 2293505^2 .
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 5505511050001 - 237 = 5368072096529 is a prime.
It is a super-2 number, since 2×55055110500012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5505511050071) 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, 37371555 + ... + 37518583.
It is an arithmetic number, because the mean of its divisors is an integer number (690756864525).
Almost surely, 25505511050001 is an apocalyptic number.
It is an amenable number.
5505511050001 is a deficient number, since it is larger than the sum of its proper divisors (20543866199).
5505511050001 is a wasteful number, since it uses less digits than its factorization.
5505511050001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 286499.
The product of its (nonzero) digits is 3125, while the sum is 28.
The spelling of 5505511050001 in words is "five trillion, five hundred five billion, five hundred eleven million, fifty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •