Base | Representation |
---|---|
bin | 11110001011110101011011… |
… | …011001110110100000110001 |
3 | 122102001020000202000020021102 |
4 | 132023311123121312200301 |
5 | 114400023034434434401 |
6 | 1150202353524134145 |
7 | 36651131445351641 |
oct | 3613653331664061 |
9 | 572036022006242 |
10 | 132754677655601 |
11 | 39332a406a1631 |
12 | 12a808b4b37355 |
13 | 590c935162751 |
14 | 24ad5099d6521 |
15 | 10533c19a556b |
hex | 78bd5b676831 |
132754677655601 has 4 divisors (see below), whose sum is σ = 132754823939172. Its totient is φ = 132754531372032.
The previous prime is 132754677655547. The next prime is 132754677655609. The reversal of 132754677655601 is 106556776457231.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 100012020361201 + 32742657294400 = 10000601^2 + 5722120^2 .
It is a cyclic number.
It is not a de Polignac number, because 132754677655601 - 214 = 132754677639217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132754677655609) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 71771960 + ... + 73598393.
It is an arithmetic number, because the mean of its divisors is an integer number (33188705984793).
Almost surely, 2132754677655601 is an apocalyptic number.
It is an amenable number.
132754677655601 is a deficient number, since it is larger than the sum of its proper divisors (146283571).
132754677655601 is an equidigital number, since it uses as much as digits as its factorization.
132754677655601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 146283570.
The product of its (nonzero) digits is 222264000, while the sum is 65.
The spelling of 132754677655601 in words is "one hundred thirty-two trillion, seven hundred fifty-four billion, six hundred seventy-seven million, six hundred fifty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •