Base | Representation |
---|---|
bin | 1110100101111101001… |
… | …10110001110111110001 |
3 | 1202221020101222112201222 |
4 | 13102332212301313301 |
5 | 31203343443334441 |
6 | 1022202455034425 |
7 | 51140336021135 |
oct | 7227646616761 |
9 | 1687211875658 |
10 | 501414043121 |
11 | 183715178a82 |
12 | 8121666ba15 |
13 | 3838b0a5494 |
14 | 1a3a8d4d3c5 |
15 | d099d4dd4b |
hex | 74be9b1df1 |
501414043121 has 24 divisors (see below), whose sum is σ = 537925559640. Its totient is φ = 467248545792.
The previous prime is 501414043099. The next prime is 501414043127. The reversal of 501414043121 is 121340414105.
It can be written as a sum of positive squares in 12 ways, for example, as 51307233121 + 450106810000 = 226511^2 + 670900^2 .
It is a de Polignac number, because none of the positive numbers 2k-501414043121 is a prime.
It is a super-3 number, since 3×5014140431213 (a number of 36 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (501414043127) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 32943305 + ... + 32958521.
It is an arithmetic number, because the mean of its divisors is an integer number (22413564985).
Almost surely, 2501414043121 is an apocalyptic number.
It is an amenable number.
501414043121 is a deficient number, since it is larger than the sum of its proper divisors (36511516519).
501414043121 is a wasteful number, since it uses less digits than its factorization.
501414043121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16373 (or 16356 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 501414043121 its reverse (121340414105), we get a palindrome (622754457226).
The spelling of 501414043121 in words is "five hundred one billion, four hundred fourteen million, forty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •