Base | Representation |
---|---|
bin | 11101111011010… |
… | …111100101011001 |
3 | 1021222210102221202 |
4 | 131323113211121 |
5 | 2012014233421 |
6 | 121453443545 |
7 | 15304541165 |
oct | 3573274531 |
9 | 1258712852 |
10 | 502102361 |
11 | 238472a32 |
12 | 1201a05b5 |
13 | 8003ccb7 |
14 | 4a981ca5 |
15 | 2e13110b |
hex | 1ded7959 |
502102361 has 8 divisors (see below), whose sum is σ = 537120360. Its totient is φ = 467693568.
The previous prime is 502102343. The next prime is 502102369. The reversal of 502102361 is 163201205.
It can be written as a sum of positive squares in 4 ways, for example, as 33120025 + 468982336 = 5755^2 + 21656^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 502102361 - 26 = 502102297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (502102369) 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 7 ways as a sum of consecutive naturals, for example, 150596 + ... + 153893.
It is an arithmetic number, because the mean of its divisors is an integer number (67140045).
Almost surely, 2502102361 is an apocalyptic number.
It is an amenable number.
502102361 is a deficient number, since it is larger than the sum of its proper divisors (35017999).
502102361 is a wasteful number, since it uses less digits than its factorization.
502102361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304603.
The product of its (nonzero) digits is 360, while the sum is 20.
The square root of 502102361 is about 22407.6406834812. The cubic root of 502102361 is about 794.8114004840.
Adding to 502102361 its reverse (163201205), we get a palindrome (665303566).
The spelling of 502102361 in words is "five hundred two million, one hundred two thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •