Base | Representation |
---|---|
bin | 111110101010101… |
… | …010000001010000 |
3 | 2201021100002220001 |
4 | 332222222001100 |
5 | 4123122311202 |
6 | 252154255344 |
7 | 35024331232 |
oct | 7652520120 |
9 | 2637302801 |
10 | 1051369552 |
11 | 49a51a562 |
12 | 254127554 |
13 | 139a84a7c |
14 | 9d8c0252 |
15 | 6247bd87 |
hex | 3eaaa050 |
1051369552 has 20 divisors (see below), whose sum is σ = 2042810100. Its totient is φ = 524192768.
The previous prime is 1051369511. The next prime is 1051369559. The reversal of 1051369552 is 2559631501.
It can be written as a sum of positive squares in 2 ways, for example, as 597509136 + 453860416 = 24444^2 + 21304^2 .
It is a super-3 number, since 3×10513695523 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a zygodrome in base 4.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1051369559) by changing a digit.
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, 87427 + ... + 98722.
It is an arithmetic number, because the mean of its divisors is an integer number (102140505).
Almost surely, 21051369552 is an apocalyptic number.
It is an amenable number.
1051369552 is a deficient number, since it is larger than the sum of its proper divisors (991440548).
1051369552 is a wasteful number, since it uses less digits than its factorization.
1051369552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186510 (or 186504 counting only the distinct ones).
The product of its (nonzero) digits is 40500, while the sum is 37.
The square root of 1051369552 is about 32424.8292516707. The cubic root of 1051369552 is about 1016.8380720169.
The spelling of 1051369552 in words is "one billion, fifty-one million, three hundred sixty-nine thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •