Base | Representation |
---|---|
bin | 111110111011000… |
… | …111010111000000 |
3 | 2201120110022020121 |
4 | 332323013113000 |
5 | 4130223342112 |
6 | 252430550024 |
7 | 35106111004 |
oct | 7673072700 |
9 | 2646408217 |
10 | 1055684032 |
11 | 4a19a7047 |
12 | 255668314 |
13 | 13a935810 |
14 | a02c4704 |
15 | 62a30407 |
hex | 3eec75c0 |
1055684032 has 56 divisors (see below), whose sum is σ = 2265883200. Its totient is φ = 485108736.
The previous prime is 1055684029. The next prime is 1055684057. The reversal of 1055684032 is 2304865501.
It is a super-2 number, since 2×10556840322 = 2228937550839554048, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 196194 + ... + 201502.
It is an arithmetic number, because the mean of its divisors is an integer number (40462200).
Almost surely, 21055684032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1055684032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1132941600).
1055684032 is an abundant number, since it is smaller than the sum of its proper divisors (1210199168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055684032 is a wasteful number, since it uses less digits than its factorization.
1055684032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5573 (or 5563 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 34.
The square root of 1055684032 is about 32491.2916332977. The cubic root of 1055684032 is about 1018.2270983728.
The spelling of 1055684032 in words is "one billion, fifty-five million, six hundred eighty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •