Base | Representation |
---|---|
bin | 11110001011101000010010… |
… | …001110101111111000101001 |
3 | 122101222212121012202102222012 |
4 | 132023220102032233320221 |
5 | 114344310134131344332 |
6 | 1150152101311205305 |
7 | 36650121642563045 |
oct | 3613502216577051 |
9 | 571885535672865 |
10 | 132740565106217 |
11 | 39327a59510382 |
12 | 12a7a016816835 |
13 | 590b4c6438003 |
14 | 24ac96b5c3025 |
15 | 1052d47a3e3b2 |
hex | 78ba123afe29 |
132740565106217 has 4 divisors (see below), whose sum is σ = 133074924212676. Its totient is φ = 132406205999760.
The previous prime is 132740565106211. The next prime is 132740565106231. The reversal of 132740565106217 is 712601565047231.
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 56200270995856 + 76540294110361 = 7496684^2 + 8748731^2 .
It is a cyclic number.
It is not a de Polignac number, because 132740565106217 - 28 = 132740565105961 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132740565106211) 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, 167179552634 + ... + 167179553427.
It is an arithmetic number, because the mean of its divisors is an integer number (33268731053169).
Almost surely, 2132740565106217 is an apocalyptic number.
It is an amenable number.
132740565106217 is a deficient number, since it is larger than the sum of its proper divisors (334359106459).
132740565106217 is an equidigital number, since it uses as much as digits as its factorization.
132740565106217 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334359106458.
The product of its (nonzero) digits is 2116800, while the sum is 50.
The spelling of 132740565106217 in words is "one hundred thirty-two trillion, seven hundred forty billion, five hundred sixty-five million, one hundred six thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •