Base | Representation |
---|---|
bin | 10000010011011110111… |
… | …001111101010010000101 |
3 | 10222010000210000220020222 |
4 | 100103132321331102011 |
5 | 121324120343412013 |
6 | 2214415145434125 |
7 | 143643221222663 |
oct | 20233671752205 |
9 | 3863023026228 |
10 | 1120431232133 |
11 | 3a2199248104 |
12 | 16119219b945 |
13 | 8186b90b245 |
14 | 3c32cb63c33 |
15 | 1e2294ee508 |
hex | 104dee7d485 |
1120431232133 has 2 divisors, whose sum is σ = 1120431232134. Its totient is φ = 1120431232132.
The previous prime is 1120431232127. The next prime is 1120431232147. The reversal of 1120431232133 is 3312321340211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 783662251009 + 336768981124 = 885247^2 + 580318^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120431232133 - 24 = 1120431232117 is a prime.
It is a super-2 number, since 2×11204312321332 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1120431232103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560215616066 + 560215616067.
It is an arithmetic number, because the mean of its divisors is an integer number (560215616067).
Almost surely, 21120431232133 is an apocalyptic number.
It is an amenable number.
1120431232133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120431232133 is an equidigital number, since it uses as much as digits as its factorization.
1120431232133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 1120431232133 its reverse (3312321340211), we get a palindrome (4432752572344).
The spelling of 1120431232133 in words is "one trillion, one hundred twenty billion, four hundred thirty-one million, two hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •