Base | Representation |
---|---|
bin | 111101010000101… |
… | …0110001110101000 |
3 | 12022020220101011120 |
4 | 1322201112032220 |
5 | 13202210442102 |
6 | 535545455240 |
7 | 101636663400 |
oct | 17241261650 |
9 | 5266811146 |
10 | 2055562152 |
11 | 9653472a6 |
12 | 4944a1520 |
13 | 269b2c387 |
14 | 156ddd800 |
15 | c06da6bc |
hex | 7a8563a8 |
2055562152 has 96 divisors (see below), whose sum is σ = 5988201120. Its totient is φ = 586293120.
The previous prime is 2055562151. The next prime is 2055562169. The reversal of 2055562152 is 2512655502.
It is a super-2 number, since 2×20555621522 = 8450671521469742208, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2055562151) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 924402 + ... + 926622.
It is an arithmetic number, because the mean of its divisors is an integer number (62377095).
Almost surely, 22055562152 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 2055562152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2994100560).
2055562152 is an abundant number, since it is smaller than the sum of its proper divisors (3932638968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2055562152 is a wasteful number, since it uses less digits than its factorization.
2055562152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3031 (or 3020 counting only the distinct ones).
The product of its (nonzero) digits is 30000, while the sum is 33.
The square root of 2055562152 is about 45338.3077760959. The cubic root of 2055562152 is about 1271.4819644022.
The spelling of 2055562152 in words is "two billion, fifty-five million, five hundred sixty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •