Base | Representation |
---|---|
bin | 10000100000100111010… |
… | …100110100011101001001 |
3 | 11000110102102111012012222 |
4 | 100200213110310131021 |
5 | 122042004432312210 |
6 | 2225110231343425 |
7 | 144652511351261 |
oct | 20404724643511 |
9 | 4013372435188 |
10 | 1134531135305 |
11 | 3a8174281047 |
12 | 163a68221b75 |
13 | 82ca7b28809 |
14 | 3cca96047a1 |
15 | 1e7a22b8655 |
hex | 10827534749 |
1134531135305 has 8 divisors (see below), whose sum is σ = 1394643151944. Its totient is φ = 885487715200.
The previous prime is 1134531135271. The next prime is 1134531135349. The reversal of 1134531135305 is 5035311354311.
It can be written as a sum of positive squares in 4 ways, for example, as 153062477824 + 981468657481 = 391232^2 + 990691^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1134531135305 - 238 = 859653228361 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2767148906 + ... + 2767149315.
It is an arithmetic number, because the mean of its divisors is an integer number (174330393993).
Almost surely, 21134531135305 is an apocalyptic number.
It is an amenable number.
1134531135305 is a deficient number, since it is larger than the sum of its proper divisors (260112016639).
1134531135305 is an equidigital number, since it uses as much as digits as its factorization.
1134531135305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5534298267.
The product of its (nonzero) digits is 40500, while the sum is 35.
Adding to 1134531135305 its reverse (5035311354311), we get a palindrome (6169842489616).
The spelling of 1134531135305 in words is "one trillion, one hundred thirty-four billion, five hundred thirty-one million, one hundred thirty-five thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •