Base | Representation |
---|---|
bin | 100001110101010… |
… | …0100000010010001 |
3 | 2221010010201100002 |
4 | 1003222210002101 |
5 | 4311104343441 |
6 | 304351535345 |
7 | 40063206503 |
oct | 10352440221 |
9 | 2833121302 |
10 | 1135231121 |
11 | 532898a42 |
12 | 27822a555 |
13 | 1512679bb |
14 | aaaadd73 |
15 | 699e4b9b |
hex | 43aa4091 |
1135231121 has 8 divisors (see below), whose sum is σ = 1141920000. Its totient is φ = 1128552480.
The previous prime is 1135231093. The next prime is 1135231127. The reversal of 1135231121 is 1211325311.
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 1135231121 - 214 = 1135214737 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1135231093 and 1135231102.
It is not an unprimeable number, because it can be changed into a prime (1135231127) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 370805 + ... + 373853.
It is an arithmetic number, because the mean of its divisors is an integer number (142740000).
Almost surely, 21135231121 is an apocalyptic number.
It is an amenable number.
1135231121 is a deficient number, since it is larger than the sum of its proper divisors (6688879).
1135231121 is a wasteful number, since it uses less digits than its factorization.
1135231121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5119.
The product of its digits is 180, while the sum is 20.
The square root of 1135231121 is about 33693.1910183645. The cubic root of 1135231121 is about 1043.1852299468.
Adding to 1135231121 its reverse (1211325311), we get a palindrome (2346556432).
The spelling of 1135231121 in words is "one billion, one hundred thirty-five million, two hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •