Base | Representation |
---|---|
bin | 10000011110010111110… |
… | …010100001000100101101 |
3 | 11000020012121011022011110 |
4 | 100132113302201010231 |
5 | 122022041442014013 |
6 | 2224031244542233 |
7 | 144536030506035 |
oct | 20362762410455 |
9 | 4006177138143 |
10 | 1132123001133 |
11 | 3a7148a13213 |
12 | 1634b5851979 |
13 | 829b2c52657 |
14 | 3cb1b8688c5 |
15 | 1e6b0b872c3 |
hex | 10797ca112d |
1132123001133 has 8 divisors (see below), whose sum is σ = 1561548967200. Its totient is φ = 728722851248.
The previous prime is 1132123001131. The next prime is 1132123001171. The reversal of 1132123001133 is 3311003212311.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1132123001133 - 21 = 1132123001131 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132123001131) 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 7 ways as a sum of consecutive naturals, for example, 6506453943 + ... + 6506454116.
It is an arithmetic number, because the mean of its divisors is an integer number (195193620900).
Almost surely, 21132123001133 is an apocalyptic number.
It is an amenable number.
1132123001133 is a deficient number, since it is larger than the sum of its proper divisors (429425966067).
1132123001133 is a wasteful number, since it uses less digits than its factorization.
1132123001133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13012908091.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1132123001133 its reverse (3311003212311), we get a palindrome (4443126213444).
The spelling of 1132123001133 in words is "one trillion, one hundred thirty-two billion, one hundred twenty-three million, one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •