Base | Representation |
---|---|
bin | 11110001010011001101010… |
… | …101101010001000011000111 |
3 | 122101200210201012010122002122 |
4 | 132022121222231101003013 |
5 | 114341414243414433323 |
6 | 1150045221042000155 |
7 | 36641043031413644 |
oct | 3612315255210307 |
9 | 571623635118078 |
10 | 132656150155463 |
11 | 392a5180473470 |
12 | 12a6579834605b |
13 | 59035627370cc |
14 | 24a884035adcb |
15 | 1050a56b81ec8 |
hex | 78a66ab510c7 |
132656150155463 has 16 divisors (see below), whose sum is σ = 145733762304000. Its totient is φ = 119748717422880.
The previous prime is 132656150155439. The next prime is 132656150155513. The reversal of 132656150155463 is 364551051656231.
It is a cyclic number.
It is not a de Polignac number, because 132656150155463 - 222 = 132656145961159 is a prime.
It is a super-2 number, since 2×1326561501554632 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132656150155663) 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 in 15 ways as a sum of consecutive naturals, for example, 7862831 + ... + 18086912.
It is an arithmetic number, because the mean of its divisors is an integer number (9108360144000).
Almost surely, 2132656150155463 is an apocalyptic number.
132656150155463 is a deficient number, since it is larger than the sum of its proper divisors (13077612148537).
132656150155463 is a wasteful number, since it uses less digits than its factorization.
132656150155463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25953022.
The product of its (nonzero) digits is 9720000, while the sum is 53.
The spelling of 132656150155463 in words is "one hundred thirty-two trillion, six hundred fifty-six billion, one hundred fifty million, one hundred fifty-five thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.292 sec. • engine limits •