Base | Representation |
---|---|
bin | 11110000100101… |
… | …00001111000110 |
3 | 122120200102002111 |
4 | 33002110033012 |
5 | 1004034443124 |
6 | 41010531234 |
7 | 6152135452 |
oct | 1702241706 |
9 | 576612074 |
10 | 252265414 |
11 | 11a440815 |
12 | 70596b1a |
13 | 4035689b |
14 | 25709662 |
15 | 17230494 |
hex | f0943c6 |
252265414 has 32 divisors (see below), whose sum is σ = 419530752. Its totient is φ = 113232000.
The previous prime is 252265411. The next prime is 252265417. The reversal of 252265414 is 414562252.
252265414 is digitally balanced in base 3, 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 (252265411) and next prime (252265417).
It is a super-3 number, since 3×2522654143 (a number of 26 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (252265411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 73149 + ... + 76519.
It is an arithmetic number, because the mean of its divisors is an integer number (13110336).
Almost surely, 2252265414 is an apocalyptic number.
252265414 is a deficient number, since it is larger than the sum of its proper divisors (167265338).
252265414 is a wasteful number, since it uses less digits than its factorization.
252265414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3492.
The product of its digits is 19200, while the sum is 31.
The square root of 252265414 is about 15882.8654215793. The cubic root of 252265414 is about 631.8576346397.
The spelling of 252265414 in words is "two hundred fifty-two million, two hundred sixty-five thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •