Base | Representation |
---|---|
bin | 1110100100000110101… |
… | …11010001000111000111 |
3 | 1202211200010202001221201 |
4 | 13102003113101013013 |
5 | 31144330022333111 |
6 | 1021520111523331 |
7 | 51103606563115 |
oct | 7220327210707 |
9 | 1684603661851 |
10 | 500420121031 |
11 | 183255126666 |
12 | 80b99829547 |
13 | 382601b58bc |
14 | 1a312d44ab5 |
15 | d03c96d6c1 |
hex | 74835d11c7 |
500420121031 has 4 divisors (see below), whose sum is σ = 505278568912. Its totient is φ = 495561673152.
The previous prime is 500420121017. The next prime is 500420121037. The reversal of 500420121031 is 130121024005.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 500420121031 - 211 = 500420118983 is a prime.
It is a super-2 number, since 2×5004201210312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (500420121037) 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 3 ways as a sum of consecutive naturals, for example, 2429223786 + ... + 2429223991.
It is an arithmetic number, because the mean of its divisors is an integer number (126319642228).
Almost surely, 2500420121031 is an apocalyptic number.
500420121031 is a deficient number, since it is larger than the sum of its proper divisors (4858447881).
500420121031 is a wasteful number, since it uses less digits than its factorization.
500420121031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4858447880.
The product of its (nonzero) digits is 240, while the sum is 19.
Adding to 500420121031 its reverse (130121024005), we get a palindrome (630541145036).
The spelling of 500420121031 in words is "five hundred billion, four hundred twenty million, one hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •