Base | Representation |
---|---|
bin | 11110001100001… |
… | …01100110100100 |
3 | 122122112122020201 |
4 | 33012011212210 |
5 | 1004313112202 |
6 | 41044040244 |
7 | 6163424002 |
oct | 1706054644 |
9 | 578478221 |
10 | 253254052 |
11 | 11aa56577 |
12 | 70993084 |
13 | 4061188c |
14 | 258c5a72 |
15 | 17378387 |
hex | f1859a4 |
253254052 has 12 divisors (see below), whose sum is σ = 443639196. Its totient is φ = 126500000.
The previous prime is 253254041. The next prime is 253254143. The reversal of 253254052 is 250452352.
It can be written as a sum of positive squares in 2 ways, for example, as 131239936 + 122014116 = 11456^2 + 11046^2 .
It is a super-2 number, since 2×2532540522 = 128275229708837408, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 253254052.
It is an unprimeable number.
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, 27199 + ... + 35302.
It is an arithmetic number, because the mean of its divisors is an integer number (36969933).
Almost surely, 2253254052 is an apocalyptic number.
It is an amenable number.
253254052 is a deficient number, since it is larger than the sum of its proper divisors (190385144).
253254052 is a wasteful number, since it uses less digits than its factorization.
253254052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63518 (or 63516 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 28.
The square root of 253254052 is about 15913.9577729740. The cubic root of 253254052 is about 632.6819835981.
It can be divided in two parts, 25325 and 4052, that multiplied together give a square (102616900 = 101302).
The spelling of 253254052 in words is "two hundred fifty-three million, two hundred fifty-four thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •