Base | Representation |
---|---|
bin | 1110100111000110101… |
… | …01110001010011010011 |
3 | 1202222211100122201221121 |
4 | 13103203111301103103 |
5 | 31211124231410311 |
6 | 1022343552303111 |
7 | 51161531331001 |
oct | 7234325612323 |
9 | 1688740581847 |
10 | 502030341331 |
11 | 183a01048a42 |
12 | 81368b41a97 |
13 | 3845898958c |
14 | 1a426b39a71 |
15 | d0d3edab71 |
hex | 74e35714d3 |
502030341331 has 4 divisors (see below), whose sum is σ = 513705465592. Its totient is φ = 490355217072.
The previous prime is 502030341283. The next prime is 502030341341. The reversal of 502030341331 is 133143030205.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-502030341331 is a prime.
It is a super-2 number, since 2×5020303413312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 502030341296 and 502030341305.
It is not an unprimeable number, because it can be changed into a prime (502030341341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5837562066 + ... + 5837562151.
It is an arithmetic number, because the mean of its divisors is an integer number (128426366398).
Almost surely, 2502030341331 is an apocalyptic number.
502030341331 is a deficient number, since it is larger than the sum of its proper divisors (11675124261).
502030341331 is a wasteful number, since it uses less digits than its factorization.
502030341331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11675124260.
The product of its (nonzero) digits is 3240, while the sum is 25.
Adding to 502030341331 its reverse (133143030205), we get a palindrome (635173371536).
The spelling of 502030341331 in words is "five hundred two billion, thirty million, three hundred forty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •