Base | Representation |
---|---|
bin | 1000100010010010… |
… | …0100001000000000 |
3 | 12220200110102020000 |
4 | 2020210210020000 |
5 | 14143032132103 |
6 | 1015210120000 |
7 | 110531420436 |
oct | 21044441000 |
9 | 5820412200 |
10 | 2291286528 |
11 | a7640a533 |
12 | 53b420000 |
13 | 2a691405b |
14 | 17a440d56 |
15 | d624eaa3 |
hex | 88924200 |
2291286528 has 100 divisors (see below), whose sum is σ = 6839010750. Its totient is φ = 763748352.
The previous prime is 2291286523. The next prime is 2291286553. The reversal of 2291286528 is 8256821922.
It can be written as a sum of positive squares in only one way, i.e., 1780164864 + 511121664 = 42192^2 + 22608^2 .
It is not an unprimeable number, because it can be changed into a prime (2291286523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 13848 + ... + 69096.
Almost surely, 22291286528 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 2291286528, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3419505375).
2291286528 is an abundant number, since it is smaller than the sum of its proper divisors (4547724222).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2291286528 is an frugal number, since it uses more digits than its factorization.
2291286528 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55279 (or 55254 counting only the distinct ones).
The product of its digits is 276480, while the sum is 45.
The square root of 2291286528 is about 47867.3848042694. The cubic root of 2291286528 is about 1318.3370795057.
The spelling of 2291286528 in words is "two billion, two hundred ninety-one million, two hundred eighty-six thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •