Base | Representation |
---|---|
bin | 11110001001011… |
… | …11000100110001 |
3 | 122121212122002002 |
4 | 33010233010301 |
5 | 1004220242013 |
6 | 41032303345 |
7 | 6160416500 |
oct | 1704570461 |
9 | 577778062 |
10 | 252899633 |
11 | 11a834268 |
12 | 70841b55 |
13 | 4051946c |
14 | 25832837 |
15 | 17308358 |
hex | f12f131 |
252899633 has 54 divisors (see below), whose sum is σ = 340479126. Its totient is φ = 186617088.
The previous prime is 252899629. The next prime is 252899681. The reversal of 252899633 is 336998252.
It is a happy number.
252899633 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 72454144 + 180445489 = 8512^2 + 13433^2 .
It is not a de Polignac number, because 252899633 - 22 = 252899629 is a prime.
Its product of digits (699840) is a multiple of the sum of its prime divisors (72).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (252899683) by changing a digit.
It is a polite number, since it can be written in 53 ways as a sum of consecutive naturals, for example, 8720663 + ... + 8720691.
It is an arithmetic number, because the mean of its divisors is an integer number (6305169).
Almost surely, 2252899633 is an apocalyptic number.
It is an amenable number.
252899633 is a deficient number, since it is larger than the sum of its proper divisors (87579493).
252899633 is a wasteful number, since it uses less digits than its factorization.
252899633 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 127 (or 72 counting only the distinct ones).
The product of its digits is 699840, while the sum is 47.
The square root of 252899633 is about 15902.8183980073. The cubic root of 252899633 is about 632.3867080333.
The spelling of 252899633 in words is "two hundred fifty-two million, eight hundred ninety-nine thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •