Base | Representation |
---|---|
bin | 1000011110001100000… |
… | …01100111001011100100 |
3 | 1000211100020000012201211 |
4 | 10033012001213023210 |
5 | 14232120242321403 |
6 | 341420032201204 |
7 | 30013234461250 |
oct | 4170601471344 |
9 | 1024306005654 |
10 | 291085120228 |
11 | 1024a2a64171 |
12 | 484b7999204 |
13 | 215abbb2416 |
14 | 10135167260 |
15 | 7889be806d |
hex | 43c60672e4 |
291085120228 has 96 divisors (see below), whose sum is σ = 605821239296. Its totient is φ = 119875140000.
The previous prime is 291085120201. The next prime is 291085120229. The reversal of 291085120228 is 822021580192.
It is not an unprimeable number, because it can be changed into a prime (291085120229) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 125955193 + ... + 125957503.
Almost surely, 2291085120228 is an apocalyptic number.
291085120228 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 291085120228, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (302910619648).
291085120228 is an abundant number, since it is smaller than the sum of its proper divisors (314736119068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
291085120228 is a wasteful number, since it uses less digits than its factorization.
291085120228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2566 (or 2502 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 40.
The spelling of 291085120228 in words is "two hundred ninety-one billion, eighty-five million, one hundred twenty thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •