Base | Representation |
---|---|
bin | 10000100000000100011… |
… | …100010110001110100000 |
3 | 11000101220122021110122111 |
4 | 100200010130112032200 |
5 | 122034310122443310 |
6 | 2224532204045104 |
7 | 144632144111521 |
oct | 20400434261640 |
9 | 4011818243574 |
10 | 1133945906080 |
11 | 3a79a39a1729 |
12 | 163924233794 |
13 | 82c13802130 |
14 | 3cc519c4848 |
15 | 1e76ac1728a |
hex | 108047163a0 |
1133945906080 has 96 divisors (see below), whose sum is σ = 2946403724544. Its totient is φ = 409779434496.
The previous prime is 1133945906057. The next prime is 1133945906081. The reversal of 1133945906080 is 806095493311.
It is a super-3 number, since 3×11339459060803 (a number of 37 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (1133945906081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5701882 + ... + 5897401.
It is an arithmetic number, because the mean of its divisors is an integer number (30691705464).
Almost surely, 21133945906080 is an apocalyptic number.
1133945906080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1133945906080 is an abundant number, since it is smaller than the sum of its proper divisors (1812457818464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1133945906080 is a wasteful number, since it uses less digits than its factorization.
1133945906080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11599358 (or 11599350 counting only the distinct ones).
The product of its (nonzero) digits is 699840, while the sum is 49.
The spelling of 1133945906080 in words is "one trillion, one hundred thirty-three billion, nine hundred forty-five million, nine hundred six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •