Base | Representation |
---|---|
bin | 111110101010001… |
… | …001101110000100 |
3 | 2201021002101102001 |
4 | 332222021232010 |
5 | 4123104043002 |
6 | 252151355044 |
7 | 35023240432 |
oct | 7652115604 |
9 | 2637071361 |
10 | 1051237252 |
11 | 49a43a11a |
12 | 254082a84 |
13 | 139a397a0 |
14 | 9d887d52 |
15 | 62452a87 |
hex | 3ea89b84 |
1051237252 has 24 divisors (see below), whose sum is σ = 1983706200. Its totient is φ = 484567296.
The previous prime is 1051237223. The next prime is 1051237267. The reversal of 1051237252 is 2527321501.
1051237252 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 4 ways, for example, as 514110276 + 537126976 = 22674^2 + 23176^2 .
It is a super-2 number, since 2×10512372522 = 2210199519985023008, 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 1051237252.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29574 + ... + 54562.
It is an arithmetic number, because the mean of its divisors is an integer number (82654425).
Almost surely, 21051237252 is an apocalyptic number.
It is an amenable number.
1051237252 is a deficient number, since it is larger than the sum of its proper divisors (932468948).
1051237252 is a wasteful number, since it uses less digits than its factorization.
1051237252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25815 (or 25813 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 28.
The square root of 1051237252 is about 32422.7890842228. The cubic root of 1051237252 is about 1016.7954186607.
Adding to 1051237252 its reverse (2527321501), we get a palindrome (3578558753).
The spelling of 1051237252 in words is "one billion, fifty-one million, two hundred thirty-seven thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •