Base | Representation |
---|---|
bin | 1000100010001111… |
… | …0100011101000110 |
3 | 12220200002111101020 |
4 | 2020203310131012 |
5 | 14143004410040 |
6 | 1015202012010 |
7 | 110526645246 |
oct | 21043643506 |
9 | 5820074336 |
10 | 2291091270 |
11 | a76296866 |
12 | 53b347006 |
13 | 2a6876210 |
14 | 17a3cdb26 |
15 | d6211cd0 |
hex | 888f4746 |
2291091270 has 96 divisors (see below), whose sum is σ = 6119771616. Its totient is φ = 545679360.
The previous prime is 2291091233. The next prime is 2291091277. The reversal of 2291091270 is 721901922.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2291091277) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 371734 + ... + 377846.
It is an arithmetic number, because the mean of its divisors is an integer number (63747621).
Almost surely, 22291091270 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2291091270, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3059885808).
2291091270 is an abundant number, since it is smaller than the sum of its proper divisors (3828680346).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2291091270 is a wasteful number, since it uses less digits than its factorization.
2291091270 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6198 (or 6167 counting only the distinct ones).
The product of its (nonzero) digits is 4536, while the sum is 33.
The square root of 2291091270 is about 47865.3451883510. The cubic root of 2291091270 is about 1318.2996299229.
The spelling of 2291091270 in words is "two billion, two hundred ninety-one million, ninety-one thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •