Base | Representation |
---|---|
bin | 10000011110011001011… |
… | …110001000100000011111 |
3 | 11000020021120020120021201 |
4 | 100132121132020200133 |
5 | 122022121202241223 |
6 | 2224034133340331 |
7 | 144536522343454 |
oct | 20363136104037 |
9 | 4006246216251 |
10 | 1132151212063 |
11 | 3a7162931533 |
12 | 1635031976a7 |
13 | 829b8a4c201 |
14 | 3cb214cd82b |
15 | 1e6b33aaead |
hex | 1079978881f |
1132151212063 has 2 divisors, whose sum is σ = 1132151212064. Its totient is φ = 1132151212062.
The previous prime is 1132151212051. The next prime is 1132151212099. The reversal of 1132151212063 is 3602121512311.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1132151212063 - 213 = 1132151203871 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1132151212013) 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, 566075606031 + 566075606032.
It is an arithmetic number, because the mean of its divisors is an integer number (566075606032).
Almost surely, 21132151212063 is an apocalyptic number.
1132151212063 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132151212063 is an equidigital number, since it uses as much as digits as its factorization.
1132151212063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 28.
Adding to 1132151212063 its reverse (3602121512311), we get a palindrome (4734272724374).
The spelling of 1132151212063 in words is "one trillion, one hundred thirty-two billion, one hundred fifty-one million, two hundred twelve thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •