Base | Representation |
---|---|
bin | 11101111011011… |
… | …100101001110010 |
3 | 1021222211111102200 |
4 | 131323130221302 |
5 | 2012020414442 |
6 | 121454124030 |
7 | 15304655544 |
oct | 3573345162 |
9 | 1258744380 |
10 | 502123122 |
11 | 238487596 |
12 | 1201b0616 |
13 | 80049597 |
14 | 4a989694 |
15 | 2e13734c |
hex | 1dedca72 |
502123122 has 12 divisors (see below), whose sum is σ = 1087933470. Its totient is φ = 167374368.
The previous prime is 502123117. The next prime is 502123123. The reversal of 502123122 is 221321205.
It can be written as a sum of positive squares in only one way, i.e., 355737321 + 146385801 = 18861^2 + 12099^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 27895729 = 502123122 / (5 + 0 + 2 + 1 + 2 + 3 + 1 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 502123095 and 502123104.
It is not an unprimeable number, because it can be changed into a prime (502123123) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 13947847 + ... + 13947882.
Almost surely, 2502123122 is an apocalyptic number.
502123122 is an abundant number, since it is smaller than the sum of its proper divisors (585810348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
502123122 is a wasteful number, since it uses less digits than its factorization.
502123122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27895737 (or 27895734 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 502123122 is about 22408.1039358532. The cubic root of 502123122 is about 794.8223549914.
Adding to 502123122 its reverse (221321205), we get a palindrome (723444327).
The spelling of 502123122 in words is "five hundred two million, one hundred twenty-three thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •