Base | Representation |
---|---|
bin | 1110100011010101111… |
… | …10111110100100011001 |
3 | 1202210121122002200011222 |
4 | 13101222332332210121 |
5 | 31143010320203231 |
6 | 1021411341101425 |
7 | 51060512141216 |
oct | 7215276764431 |
9 | 1683548080158 |
10 | 500011100441 |
11 | 18306525a416 |
12 | 80aa4857875 |
13 | 381c6536498 |
14 | 1a2b48b2b0d |
15 | d016ac727b |
hex | 746afbe919 |
500011100441 has 16 divisors (see below), whose sum is σ = 533262837888. Its totient is φ = 467189856000.
The previous prime is 500011100419. The next prime is 500011100443. The reversal of 500011100441 is 144001110005.
It is a cyclic number.
It is not a de Polignac number, because 500011100441 - 214 = 500011084057 is a prime.
It is a super-2 number, since 2×5000111004412 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (500011100443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4101026 + ... + 4221188.
It is an arithmetic number, because the mean of its divisors is an integer number (33328927368).
Almost surely, 2500011100441 is an apocalyptic number.
It is an amenable number.
500011100441 is a deficient number, since it is larger than the sum of its proper divisors (33251737447).
500011100441 is a wasteful number, since it uses less digits than its factorization.
500011100441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121952.
The product of its (nonzero) digits is 80, while the sum is 17.
Adding to 500011100441 its reverse (144001110005), we get a palindrome (644012210446).
The spelling of 500011100441 in words is "five hundred billion, eleven million, one hundred thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •