Base | Representation |
---|---|
bin | 1110101101101011000… |
… | …00110100111001011001 |
3 | 1210022221002122212120012 |
4 | 13112311200310321121 |
5 | 31240334423030001 |
6 | 1024125513211305 |
7 | 51345105651533 |
oct | 7266540647131 |
9 | 1708832585505 |
10 | 505556455001 |
11 | 185450491374 |
12 | 81b91a00b35 |
13 | 3889b369c80 |
14 | 1a67d174853 |
15 | d23d8552bb |
hex | 75b5834e59 |
505556455001 has 8 divisors (see below), whose sum is σ = 559160154504. Its totient is φ = 454054861440.
The previous prime is 505556454947. The next prime is 505556455007. The reversal of 505556455001 is 100554655505.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 72118565401 + 433437889600 = 268549^2 + 658360^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 505556455001 - 230 = 504482713177 is a prime.
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 505556455001.
It is not an unprimeable number, because it can be changed into a prime (505556455007) 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, 525525980 + ... + 525526941.
It is an arithmetic number, because the mean of its divisors is an integer number (69895019313).
Almost surely, 2505556455001 is an apocalyptic number.
It is an amenable number.
505556455001 is a deficient number, since it is larger than the sum of its proper divisors (53603699503).
505556455001 is a wasteful number, since it uses less digits than its factorization.
505556455001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1051052971.
The product of its (nonzero) digits is 375000, while the sum is 41.
The spelling of 505556455001 in words is "five hundred five billion, five hundred fifty-six million, four hundred fifty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •