Base | Representation |
---|---|
bin | 10000011110101010110… |
… | …111010110100110001111 |
3 | 11000021000220100202112102 |
4 | 100132222313112212033 |
5 | 122023220404123142 |
6 | 2224123120225315 |
7 | 144546664661321 |
oct | 20365267264617 |
9 | 4007026322472 |
10 | 1132443036047 |
11 | 3a72a2631184 |
12 | 163584a6b23b |
13 | 82a3434671b |
14 | 3cb4c175611 |
15 | 1e6cdd02532 |
hex | 107aadd698f |
1132443036047 has 2 divisors, whose sum is σ = 1132443036048. Its totient is φ = 1132443036046.
The previous prime is 1132443036001. The next prime is 1132443036113. The reversal of 1132443036047 is 7406303442311.
It is a weak prime.
It is an emirp because it is prime and its reverse (7406303442311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1132443036047 - 210 = 1132443035023 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1132443036047.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1132443036847) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566221518023 + 566221518024.
It is an arithmetic number, because the mean of its divisors is an integer number (566221518024).
Almost surely, 21132443036047 is an apocalyptic number.
1132443036047 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132443036047 is an equidigital number, since it uses as much as digits as its factorization.
1132443036047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145152, while the sum is 38.
Adding to 1132443036047 its reverse (7406303442311), we get a palindrome (8538746478358).
The spelling of 1132443036047 in words is "one trillion, one hundred thirty-two billion, four hundred forty-three million, thirty-six thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •