Base | Representation |
---|---|
bin | 10000011111011111001… |
… | …001001000001110011000 |
3 | 11000100022000201210011221 |
4 | 100133133021020032120 |
5 | 122032014422023000 |
6 | 2224350131101424 |
7 | 144610504666210 |
oct | 20373711101630 |
9 | 4010260653157 |
10 | 1133320111000 |
11 | 3a7702725610 |
12 | 16378a741874 |
13 | 82b43c7449c |
14 | 3cbd2845240 |
15 | 1e730d0161a |
hex | 107df248398 |
1133320111000 has 128 divisors (see below), whose sum is σ = 3306351260160. Its totient is φ = 353242608000.
The previous prime is 1133320110973. The next prime is 1133320111003. The reversal of 1133320111000 is 1110233311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1133320111003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7282222 + ... + 7436221.
It is an arithmetic number, because the mean of its divisors is an integer number (25830869220).
Almost surely, 21133320111000 is an apocalyptic number.
1133320111000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1133320111000 is an abundant number, since it is smaller than the sum of its proper divisors (2173031149160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1133320111000 is a wasteful number, since it uses less digits than its factorization.
1133320111000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14718482 (or 14718468 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1133320111000 its reverse (1110233311), we get a palindrome (1134430344311).
The spelling of 1133320111000 in words is "one trillion, one hundred thirty-three billion, three hundred twenty million, one hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •