Base | Representation |
---|---|
bin | 100001110001000… |
… | …0100110001001100 |
3 | 2220221221122220111 |
4 | 1003202010301030 |
5 | 4310022142100 |
6 | 304232125404 |
7 | 40035251125 |
oct | 10342046114 |
9 | 2827848814 |
10 | 1133005900 |
11 | 531609114 |
12 | 277536864 |
13 | 150968bc0 |
14 | aa69104c |
15 | 697056ba |
hex | 43884c4c |
1133005900 has 72 divisors (see below), whose sum is σ = 2668360464. Its totient is φ = 415084800.
The previous prime is 1133005889. The next prime is 1133005927. The reversal of 1133005900 is 95003311.
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 23 ways as a sum of consecutive naturals, for example, 166974 + ... + 173626.
It is an arithmetic number, because the mean of its divisors is an integer number (37060562).
Almost surely, 21133005900 is an apocalyptic number.
1133005900 is a gapful number since it is divisible by the number (10) 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 1133005900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1334180232).
1133005900 is an abundant number, since it is smaller than the sum of its proper divisors (1535354564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1133005900 is a wasteful number, since it uses less digits than its factorization.
1133005900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6811 (or 6804 counting only the distinct ones).
The product of its (nonzero) digits is 405, while the sum is 22.
The square root of 1133005900 is about 33660.1530002464. The cubic root of 1133005900 is about 1042.5031849723.
The spelling of 1133005900 in words is "one billion, one hundred thirty-three million, five thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •