Base | Representation |
---|---|
bin | 11110000100100001010001… |
… | …110100001101111110010011 |
3 | 122100021011112122220010112112 |
4 | 132010201101310031332103 |
5 | 114313304101414343101 |
6 | 1145135422130015535 |
7 | 36566614662513656 |
oct | 3604412164157623 |
9 | 570234478803475 |
10 | 132252005621651 |
11 | 39159840409513 |
12 | 129bb3a91175ab |
13 | 58a44065704c6 |
14 | 249306197d89d |
15 | 10452a14b36bb |
hex | 784851d0df93 |
132252005621651 has 2 divisors, whose sum is σ = 132252005621652. Its totient is φ = 132252005621650.
The previous prime is 132252005621629. The next prime is 132252005621657. The reversal of 132252005621651 is 156126500252231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132252005621651 - 222 = 132252001427347 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132252005621599 and 132252005621608.
It is not a weakly prime, because it can be changed into another prime (132252005621657) 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, 66126002810825 + 66126002810826.
It is an arithmetic number, because the mean of its divisors is an integer number (66126002810826).
Almost surely, 2132252005621651 is an apocalyptic number.
132252005621651 is a deficient number, since it is larger than the sum of its proper divisors (1).
132252005621651 is an equidigital number, since it uses as much as digits as its factorization.
132252005621651 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216000, while the sum is 41.
Adding to 132252005621651 its reverse (156126500252231), we get a palindrome (288378505873882).
The spelling of 132252005621651 in words is "one hundred thirty-two trillion, two hundred fifty-two billion, five million, six hundred twenty-one thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •