Base | Representation |
---|---|
bin | 10000100000100111010… |
… | …100110001110110000101 |
3 | 11000110102102110122112222 |
4 | 100200213110301312011 |
5 | 122042004431441423 |
6 | 2225110231222125 |
7 | 144652511305145 |
oct | 20404724616605 |
9 | 4013372418488 |
10 | 1134531124613 |
11 | 3a8174274007 |
12 | 163a68217945 |
13 | 82ca7b239a3 |
14 | 3cca9600925 |
15 | 1e7a22b53c8 |
hex | 10827531d85 |
1134531124613 has 2 divisors, whose sum is σ = 1134531124614. Its totient is φ = 1134531124612.
The previous prime is 1134531124513. The next prime is 1134531124619. The reversal of 1134531124613 is 3164211354311.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1133762837089 + 768287524 = 1064783^2 + 27718^2 .
It is a cyclic number.
It is not a de Polignac number, because 1134531124613 - 238 = 859653217669 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1134531124619) by changing a digit.
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 as a sum of consecutive naturals, namely, 567265562306 + 567265562307.
It is an arithmetic number, because the mean of its divisors is an integer number (567265562307).
Almost surely, 21134531124613 is an apocalyptic number.
It is an amenable number.
1134531124613 is a deficient number, since it is larger than the sum of its proper divisors (1).
1134531124613 is an equidigital number, since it uses as much as digits as its factorization.
1134531124613 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 25920, while the sum is 35.
Adding to 1134531124613 its reverse (3164211354311), we get a palindrome (4298742478924).
The spelling of 1134531124613 in words is "one trillion, one hundred thirty-four billion, five hundred thirty-one million, one hundred twenty-four thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •