Base | Representation |
---|---|
bin | 111110111001011… |
… | …000001001110100 |
3 | 2201112121011102020 |
4 | 332321120021310 |
5 | 4130114303112 |
6 | 252413113140 |
7 | 35102203011 |
oct | 7671301164 |
9 | 2645534366 |
10 | 1055228532 |
11 | 4a17158a6 |
12 | 2554887b0 |
13 | 13a8063a7 |
14 | a0206708 |
15 | 6299048c |
hex | 3ee58274 |
1055228532 has 24 divisors (see below), whose sum is σ = 2466023616. Its totient is φ = 351196608.
The previous prime is 1055228519. The next prime is 1055228533. The reversal of 1055228532 is 2358225501.
It is a super-2 number, since 2×10552285322 = 2227014509493750048, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1055228493 and 1055228502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055228533) 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, 60193 + ... + 75720.
It is an arithmetic number, because the mean of its divisors is an integer number (102750984).
Almost surely, 21055228532 is an apocalyptic number.
1055228532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1055228532 is an abundant number, since it is smaller than the sum of its proper divisors (1410795084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055228532 is a wasteful number, since it uses less digits than its factorization.
1055228532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136567 (or 136565 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 33.
The square root of 1055228532 is about 32484.2813065027. The cubic root of 1055228532 is about 1018.0806312004.
The spelling of 1055228532 in words is "one billion, fifty-five million, two hundred twenty-eight thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •