Base | Representation |
---|---|
bin | 11110001010011001110101… |
… | …100000110111111110101111 |
3 | 122101200211011211021200021022 |
4 | 132022121311200313332233 |
5 | 114341420131323101211 |
6 | 1150045251035524355 |
7 | 36641050362431126 |
oct | 3612316540677657 |
9 | 571624154250238 |
10 | 132656331456431 |
11 | 392a5263844582 |
12 | 12a65828bb96bb |
13 | 59035911751a3 |
14 | 24a885a472abd |
15 | 1050a67a45bdb |
hex | 78a675837faf |
132656331456431 has 2 divisors, whose sum is σ = 132656331456432. Its totient is φ = 132656331456430.
The previous prime is 132656331456287. The next prime is 132656331456443. The reversal of 132656331456431 is 134654133656231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132656331456431 - 218 = 132656331194287 is a prime.
It is a super-3 number, since 3×1326563314564313 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132656331956431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66328165728215 + 66328165728216.
It is an arithmetic number, because the mean of its divisors is an integer number (66328165728216).
Almost surely, 2132656331456431 is an apocalyptic number.
132656331456431 is a deficient number, since it is larger than the sum of its proper divisors (1).
132656331456431 is an equidigital number, since it uses as much as digits as its factorization.
132656331456431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13996800, while the sum is 53.
The spelling of 132656331456431 in words is "one hundred thirty-two trillion, six hundred fifty-six billion, three hundred thirty-one million, four hundred fifty-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •