Base | Representation |
---|---|
bin | 111101010010000… |
… | …0001001100101010 |
3 | 12022022012221210020 |
4 | 1322210001030222 |
5 | 13202400344232 |
6 | 540012501310 |
7 | 101645641143 |
oct | 17244011452 |
9 | 5268187706 |
10 | 2056262442 |
11 | 965785453 |
12 | 49477a836 |
13 | 26a016050 |
14 | 157142aca |
15 | c07c7e2c |
hex | 7a90132a |
2056262442 has 64 divisors (see below), whose sum is σ = 4488462720. Its totient is φ = 624236544.
The previous prime is 2056262419. The next prime is 2056262443. The reversal of 2056262442 is 2442626502.
It is not an unprimeable number, because it can be changed into a prime (2056262443) 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 31 ways as a sum of consecutive naturals, for example, 3613534 + ... + 3614102.
It is an arithmetic number, because the mean of its divisors is an integer number (70132230).
Almost surely, 22056262442 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2056262442, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2244231360).
2056262442 is an abundant number, since it is smaller than the sum of its proper divisors (2432200278).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2056262442 is a wasteful number, since it uses less digits than its factorization.
2056262442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1127.
The product of its (nonzero) digits is 46080, while the sum is 33.
The square root of 2056262442 is about 45346.0300577680. The cubic root of 2056262442 is about 1271.6263377242.
Adding to 2056262442 its reverse (2442626502), we get a palindrome (4498888944).
The spelling of 2056262442 in words is "two billion, fifty-six million, two hundred sixty-two thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •