Base | Representation |
---|---|
bin | 100000100010010… |
… | …0001010110011100 |
3 | 2211002020022122122 |
4 | 1001010201112130 |
5 | 4213434013340 |
6 | 300155002112 |
7 | 36024222065 |
oct | 10104412634 |
9 | 2732208578 |
10 | 1091704220 |
11 | 5102695a2 |
12 | 265739338 |
13 | 145237a39 |
14 | a4dbd56c |
15 | 65c97db5 |
hex | 4112159c |
1091704220 has 48 divisors (see below), whose sum is σ = 2320164000. Its totient is φ = 431458560.
The previous prime is 1091704219. The next prime is 1091704247. The reversal of 1091704220 is 224071901.
It is a super-3 number, since 3×10917042203 (a number of 28 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1091704220.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 704006 + ... + 705554.
It is an arithmetic number, because the mean of its divisors is an integer number (48336750).
Almost surely, 21091704220 is an apocalyptic number.
1091704220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1091704220 is an abundant number, since it is smaller than the sum of its proper divisors (1228459780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1091704220 is a wasteful number, since it uses less digits than its factorization.
1091704220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1958 (or 1956 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 26.
The square root of 1091704220 is about 33040.9476256357. The cubic root of 1091704220 is about 1029.6785436046.
The spelling of 1091704220 in words is "one billion, ninety-one million, seven hundred four thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •