Base | Representation |
---|---|
bin | 11110000101000… |
… | …00001101011101 |
3 | 122120202220101001 |
4 | 33002200031131 |
5 | 1004043030321 |
6 | 41011550301 |
7 | 6152431450 |
oct | 1702401535 |
9 | 576686331 |
10 | 252314461 |
11 | 11a474653 |
12 | 705bb391 |
13 | 40372cc9 |
14 | 2571d497 |
15 | 1723ec91 |
hex | f0a035d |
252314461 has 4 divisors (see below), whose sum is σ = 288359392. Its totient is φ = 216269532.
The previous prime is 252314443. The next prime is 252314467. The reversal of 252314461 is 164413252.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 252314461 - 219 = 251790173 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (252314467) 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 3 ways as a sum of consecutive naturals, for example, 18022455 + ... + 18022468.
It is an arithmetic number, because the mean of its divisors is an integer number (72089848).
Almost surely, 2252314461 is an apocalyptic number.
It is an amenable number.
252314461 is a deficient number, since it is larger than the sum of its proper divisors (36044931).
252314461 is an equidigital number, since it uses as much as digits as its factorization.
252314461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36044930.
The product of its digits is 5760, while the sum is 28.
The square root of 252314461 is about 15884.4093689378. The cubic root of 252314461 is about 631.8985818741.
It can be divided in two parts, 25231 and 4461, that added together give a palindrome (29692).
The spelling of 252314461 in words is "two hundred fifty-two million, three hundred fourteen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •