Base | Representation |
---|---|
bin | 10000100000111111111… |
… | …011100001000100101001 |
3 | 11000111111012020110210212 |
4 | 100200333323201010221 |
5 | 122043331121321323 |
6 | 2225215215150505 |
7 | 144665653153253 |
oct | 20407773410451 |
9 | 4014435213725 |
10 | 1134943932713 |
11 | 3a8366297928 |
12 | 163b62515435 |
13 | 830424cb036 |
14 | 3cd0837acd3 |
15 | 1e7c8658b78 |
hex | 1083fee1129 |
1134943932713 has 2 divisors, whose sum is σ = 1134943932714. Its totient is φ = 1134943932712.
The previous prime is 1134943932697. The next prime is 1134943932877. The reversal of 1134943932713 is 3172393494311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1002587671849 + 132356260864 = 1001293^2 + 363808^2 .
It is a cyclic number.
It is not a de Polignac number, because 1134943932713 - 24 = 1134943932697 is a prime.
It is not a weakly prime, because it can be changed into another prime (1134943932313) 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 as a sum of consecutive naturals, namely, 567471966356 + 567471966357.
It is an arithmetic number, because the mean of its divisors is an integer number (567471966357).
Almost surely, 21134943932713 is an apocalyptic number.
It is an amenable number.
1134943932713 is a deficient number, since it is larger than the sum of its proper divisors (1).
1134943932713 is an equidigital number, since it uses as much as digits as its factorization.
1134943932713 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1469664, while the sum is 50.
The spelling of 1134943932713 in words is "one trillion, one hundred thirty-four billion, nine hundred forty-three million, nine hundred thirty-two thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •