Base | Representation |
---|---|
bin | 11110001101101… |
… | …01111100010011 |
3 | 122122220200212000 |
4 | 33012311330103 |
5 | 1004340431201 |
6 | 41052205043 |
7 | 6165210156 |
oct | 1706657423 |
9 | 578820760 |
10 | 253452051 |
11 | 120081306 |
12 | 70a69783 |
13 | 40680a38 |
14 | 25937c9d |
15 | 173b6d86 |
hex | f1b5f13 |
253452051 has 8 divisors (see below), whose sum is σ = 375484560. Its totient is φ = 168968016.
The previous prime is 253452029. The next prime is 253452061. The reversal of 253452051 is 150254352.
It is a happy number.
It is not a de Polignac number, because 253452051 - 211 = 253450003 is a prime.
It is a super-2 number, since 2×2534520512 = 128475884312213202, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 9387113 = 253452051 / (2 + 5 + 3 + 4 + 5 + 2 + 0 + 5 + 1).
It is not an unprimeable number, because it can be changed into a prime (253452061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4693530 + ... + 4693583.
It is an arithmetic number, because the mean of its divisors is an integer number (46935570).
Almost surely, 2253452051 is an apocalyptic number.
253452051 is a deficient number, since it is larger than the sum of its proper divisors (122032509).
253452051 is an equidigital number, since it uses as much as digits as its factorization.
253452051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9387122 (or 9387116 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
The square root of 253452051 is about 15920.1774801665. The cubic root of 253452051 is about 632.8468217215.
The spelling of 253452051 in words is "two hundred fifty-three million, four hundred fifty-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •