Base | Representation |
---|---|
bin | 1110100111110110010… |
… | …11001000000010001011 |
3 | 1210000212020001212110200 |
4 | 13103323023020002023 |
5 | 31212434113012133 |
6 | 1022451354543243 |
7 | 51204455161335 |
oct | 7237313100213 |
9 | 1700766055420 |
10 | 502430204043 |
11 | 18409682a799 |
12 | 8145aa37b23 |
13 | 384c0780531 |
14 | 1a463ca6455 |
15 | d109173913 |
hex | 74fb2c808b |
502430204043 has 12 divisors (see below), whose sum is σ = 726048494808. Its totient is φ = 334807633440.
The previous prime is 502430204041. The next prime is 502430204051. The reversal of 502430204043 is 340402034205.
It is not a de Polignac number, because 502430204043 - 21 = 502430204041 is a prime.
It is a super-2 number, since 2×5024302040432 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 502430203998 and 502430204016.
It is not an unprimeable number, because it can be changed into a prime (502430204041) 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 11 ways as a sum of consecutive naturals, for example, 12131173 + ... + 12172518.
It is an arithmetic number, because the mean of its divisors is an integer number (60504041234).
Almost surely, 2502430204043 is an apocalyptic number.
502430204043 is a deficient number, since it is larger than the sum of its proper divisors (223618290765).
502430204043 is a wasteful number, since it uses less digits than its factorization.
502430204043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24305994 (or 24305991 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 27.
Adding to 502430204043 its reverse (340402034205), we get a palindrome (842832238248).
The spelling of 502430204043 in words is "five hundred two billion, four hundred thirty million, two hundred four thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •