Base | Representation |
---|---|
bin | 1110101001010101111… |
… | …11010101100010110101 |
3 | 1210002221010120122220120 |
4 | 13110222333111202311 |
5 | 31221104444420041 |
6 | 1023103133122153 |
7 | 51233365664412 |
oct | 7245277254265 |
9 | 1702833518816 |
10 | 503232420021 |
11 | 184468644501 |
12 | 81643629359 |
13 | 385baa2ac46 |
14 | 1a4dc64b109 |
15 | d1547d7366 |
hex | 752afd58b5 |
503232420021 has 8 divisors (see below), whose sum is σ = 677893844544. Its totient is φ = 332029637760.
The previous prime is 503232420011. The next prime is 503232420023. The reversal of 503232420021 is 120024232305.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 503232420021 - 29 = 503232419509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 503232419973 and 503232420000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (503232420023) 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 7 ways as a sum of consecutive naturals, for example, 864660225 + ... + 864660806.
It is an arithmetic number, because the mean of its divisors is an integer number (84736730568).
Almost surely, 2503232420021 is an apocalyptic number.
It is an amenable number.
503232420021 is a deficient number, since it is larger than the sum of its proper divisors (174661424523).
503232420021 is a wasteful number, since it uses less digits than its factorization.
503232420021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1729321131.
The product of its (nonzero) digits is 2880, while the sum is 24.
Adding to 503232420021 its reverse (120024232305), we get a palindrome (623256652326).
The spelling of 503232420021 in words is "five hundred three billion, two hundred thirty-two million, four hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •