Base | Representation |
---|---|
bin | 11110000010100000110110… |
… | …001010000001001101110111 |
3 | 122022202222120222001212011122 |
4 | 132002200312022001031313 |
5 | 114304024140232333142 |
6 | 1144552214134054155 |
7 | 36553633423403351 |
oct | 3602406612011567 |
9 | 568688528055148 |
10 | 132114102621047 |
11 | 391063047a4028 |
12 | 129987217aa35b |
13 | 58943ca288671 |
14 | 248a4dca5a0d1 |
15 | 10418ce9151d2 |
hex | 782836281377 |
132114102621047 has 2 divisors, whose sum is σ = 132114102621048. Its totient is φ = 132114102621046.
The previous prime is 132114102621019. The next prime is 132114102621073. The reversal of 132114102621047 is 740126201411231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132114102621047 - 246 = 61745358443383 is a prime.
It is a super-2 number, since 2×1321141026210472 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132114102620998 and 132114102621016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132114102620047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66057051310523 + 66057051310524.
It is an arithmetic number, because the mean of its divisors is an integer number (66057051310524).
Almost surely, 2132114102621047 is an apocalyptic number.
132114102621047 is a deficient number, since it is larger than the sum of its proper divisors (1).
132114102621047 is an equidigital number, since it uses as much as digits as its factorization.
132114102621047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 35.
The spelling of 132114102621047 in words is "one hundred thirty-two trillion, one hundred fourteen billion, one hundred two million, six hundred twenty-one thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.292 sec. • engine limits •