Base | Representation |
---|---|
bin | 10000011101111010000… |
… | …110101001101111100111 |
3 | 11000011220220000100100102 |
4 | 100131322012221233213 |
5 | 122020031442304142 |
6 | 2223510014134315 |
7 | 144520502322665 |
oct | 20357206515747 |
9 | 4004826010312 |
10 | 1131624963047 |
11 | 3a6a12876897 |
12 | 163396ab139b |
13 | 82933a06567 |
14 | 3cab1663c35 |
15 | 1e6820aa532 |
hex | 1077a1a9be7 |
1131624963047 has 2 divisors, whose sum is σ = 1131624963048. Its totient is φ = 1131624963046.
The previous prime is 1131624963013. The next prime is 1131624963067. The reversal of 1131624963047 is 7403694261311.
It is a strong prime.
It is an emirp because it is prime and its reverse (7403694261311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1131624963047 - 28 = 1131624962791 is a prime.
It is a super-2 number, since 2×11316249630472 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1131624962992 and 1131624963010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1131624963067) 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, 565812481523 + 565812481524.
It is an arithmetic number, because the mean of its divisors is an integer number (565812481524).
Almost surely, 21131624963047 is an apocalyptic number.
1131624963047 is a deficient number, since it is larger than the sum of its proper divisors (1).
1131624963047 is an equidigital number, since it uses as much as digits as its factorization.
1131624963047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 653184, while the sum is 47.
The spelling of 1131624963047 in words is "one trillion, one hundred thirty-one billion, six hundred twenty-four million, nine hundred sixty-three thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •