Base | Representation |
---|---|
bin | 1110100101011001000… |
… | …10111010100000010111 |
3 | 1202220110021211101122000 |
4 | 13102230202322200113 |
5 | 31202233411240043 |
6 | 1022112432410343 |
7 | 51126666363156 |
oct | 7225442724027 |
9 | 1686407741560 |
10 | 501111040023 |
11 | 18357a1332a0 |
12 | 811510a69b3 |
13 | 383403957c9 |
14 | 1a37a9d759d |
15 | d07d44a2d3 |
hex | 74ac8ba817 |
501111040023 has 16 divisors (see below), whose sum is σ = 809876428800. Its totient is φ = 303703660440.
The previous prime is 501111040007. The next prime is 501111040033. The reversal of 501111040023 is 320040111105.
It is not a de Polignac number, because 501111040023 - 24 = 501111040007 is a prime.
It is a super-2 number, since 2×5011110400232 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 501111039978 and 501111040005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (501111040033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 843620983 + ... + 843621576.
It is an arithmetic number, because the mean of its divisors is an integer number (50617276800).
Almost surely, 2501111040023 is an apocalyptic number.
501111040023 is a deficient number, since it is larger than the sum of its proper divisors (308765388777).
501111040023 is a wasteful number, since it uses less digits than its factorization.
501111040023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1687242579 (or 1687242573 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
Adding to 501111040023 its reverse (320040111105), we get a palindrome (821151151128).
The spelling of 501111040023 in words is "five hundred one billion, one hundred eleven million, forty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •