Base | Representation |
---|---|
bin | 11110000011011… |
… | …01001010000001 |
3 | 122120101021112000 |
4 | 33001231022001 |
5 | 1004014332340 |
6 | 41003254213 |
7 | 6150601002 |
oct | 1701551201 |
9 | 576337460 |
10 | 252105345 |
11 | 11a341528 |
12 | 7051a369 |
13 | 402cba7b |
14 | 256a71a9 |
15 | 171ecd30 |
hex | f06d281 |
252105345 has 64 divisors (see below), whose sum is σ = 463415040. Its totient is φ = 129959424.
The previous prime is 252105341. The next prime is 252105349. The reversal of 252105345 is 543501252.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (252105341) and next prime (252105349).
It is not a de Polignac number, because 252105345 - 22 = 252105341 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (252105341) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 795127 + ... + 795443.
It is an arithmetic number, because the mean of its divisors is an integer number (7240860).
Almost surely, 2252105345 is an apocalyptic number.
It is an amenable number.
252105345 is a deficient number, since it is larger than the sum of its proper divisors (211309695).
252105345 is a wasteful number, since it uses less digits than its factorization.
252105345 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 511 (or 505 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
The square root of 252105345 is about 15877.8255753110. The cubic root of 252105345 is about 631.7239629672.
Adding to 252105345 its reverse (543501252), we get a palindrome (795606597).
It can be divided in two parts, 25 and 2105345, that multiplied together give a palindrome (52633625).
The spelling of 252105345 in words is "two hundred fifty-two million, one hundred five thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •