Base | Representation |
---|---|
bin | 11110001010011110100111… |
… | …010101010000110110000001 |
3 | 122101201022102101202112001010 |
4 | 132022132213111100312001 |
5 | 114342011133313200031 |
6 | 1150051500122231133 |
7 | 36641321463403515 |
oct | 3612364725206601 |
9 | 571638371675033 |
10 | 132661462240641 |
11 | 392a7456a59704 |
12 | 12a6681b3554a9 |
13 | 5903bcb135489 |
14 | 24a8bc5a5a145 |
15 | 1050c681d3246 |
hex | 78a7a7550d81 |
132661462240641 has 8 divisors (see below), whose sum is σ = 177348656646880. Its totient is φ = 88207621330752.
The previous prime is 132661462240607. The next prime is 132661462240673. The reversal of 132661462240641 is 146042264166231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132661462240641 - 235 = 132627102502273 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (132661462240441) 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 7 ways as a sum of consecutive naturals, for example, 58338372760 + ... + 58338375033.
It is an arithmetic number, because the mean of its divisors is an integer number (22168582080860).
Almost surely, 2132661462240641 is an apocalyptic number.
It is an amenable number.
132661462240641 is a deficient number, since it is larger than the sum of its proper divisors (44687194406239).
132661462240641 is a wasteful number, since it uses less digits than its factorization.
132661462240641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116676748175.
The product of its (nonzero) digits is 1990656, while the sum is 48.
The spelling of 132661462240641 in words is "one hundred thirty-two trillion, six hundred sixty-one billion, four hundred sixty-two million, two hundred forty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •