Base | Representation |
---|---|
bin | 11110000110100… |
… | …00111101001001 |
3 | 122121011001020212 |
4 | 33003100331021 |
5 | 1004120422441 |
6 | 41020130505 |
7 | 6154222526 |
oct | 1703207511 |
9 | 577131225 |
10 | 252514121 |
11 | 11a5a0662 |
12 | 70696a35 |
13 | 40412b52 |
14 | 2577214d |
15 | 1727deeb |
hex | f0d0f49 |
252514121 has 8 divisors (see below), whose sum is σ = 259308000. Its totient is φ = 245750560.
The previous prime is 252514091. The next prime is 252514151. The reversal of 252514121 is 121415252.
252514121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (252514091) and next prime (252514151).
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 252514121 - 26 = 252514057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (252514151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9830 + ... + 24528.
It is an arithmetic number, because the mean of its divisors is an integer number (32413500).
Almost surely, 2252514121 is an apocalyptic number.
It is an amenable number.
252514121 is a deficient number, since it is larger than the sum of its proper divisors (6793879).
252514121 is a wasteful number, since it uses less digits than its factorization.
252514121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15159.
The product of its digits is 800, while the sum is 23.
The square root of 252514121 is about 15890.6929049680. The cubic root of 252514121 is about 632.0652146893.
Adding to 252514121 its reverse (121415252), we get a palindrome (373929373).
The spelling of 252514121 in words is "two hundred fifty-two million, five hundred fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •