Base | Representation |
---|---|
bin | 111110111011010… |
… | …111111111000100 |
3 | 2201120120202122211 |
4 | 332323113333010 |
5 | 4130233032012 |
6 | 252432233204 |
7 | 35106513361 |
oct | 7673277704 |
9 | 2646522584 |
10 | 1055752132 |
11 | 4a1a43226 |
12 | 25569b804 |
13 | 13a95a806 |
14 | a0301468 |
15 | 62a456a7 |
hex | 3eed7fc4 |
1055752132 has 24 divisors (see below), whose sum is σ = 1923673752. Its totient is φ = 506553600.
The previous prime is 1055752099. The next prime is 1055752133. The reversal of 1055752132 is 2312575501.
It can be written as a sum of positive squares in 4 ways, for example, as 4955076 + 1050797056 = 2226^2 + 32416^2 .
It is a super-2 number, since 2×10557521322 = 2229225128445090848, which contains 22 as substring.
It is a hoax number, since the sum of its digits (31) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 1055752094 and 1055752103.
It is not an unprimeable number, because it can be changed into a prime (1055752133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42763 + ... + 62770.
It is an arithmetic number, because the mean of its divisors is an integer number (80153073).
Almost surely, 21055752132 is an apocalyptic number.
It is an amenable number.
1055752132 is a deficient number, since it is larger than the sum of its proper divisors (867921620).
1055752132 is a wasteful number, since it uses less digits than its factorization.
1055752132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105639 (or 105637 counting only the distinct ones).
The product of its (nonzero) digits is 10500, while the sum is 31.
The square root of 1055752132 is about 32492.3395895094. The cubic root of 1055752132 is about 1018.2489924788.
The spelling of 1055752132 in words is "one billion, fifty-five million, seven hundred fifty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •