Base | Representation |
---|---|
bin | 11110001000011011001111… |
… | …100110111111101001000101 |
3 | 122101012211022210220022202002 |
4 | 132020123033212333221011 |
5 | 114332203241414303040 |
6 | 1145503011055555045 |
7 | 36625166102541623 |
oct | 3610331746775105 |
9 | 571184283808662 |
10 | 132520404056645 |
11 | 39252651321240 |
12 | 12a4341322ba85 |
13 | 58c380b273b07 |
14 | 24a2043a96513 |
15 | 104c25e63aa15 |
hex | 7886cf9bfa45 |
132520404056645 has 128 divisors (see below), whose sum is σ = 196084875313152. Its totient is φ = 84774161612800.
The previous prime is 132520404056641. The next prime is 132520404056699. The reversal of 132520404056645 is 546650404025231.
It is not a de Polignac number, because 132520404056645 - 22 = 132520404056641 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132520404056645.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132520404056641) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 593189765 + ... + 593413125.
It is an arithmetic number, because the mean of its divisors is an integer number (1531913088384).
Almost surely, 2132520404056645 is an apocalyptic number.
It is an amenable number.
132520404056645 is a deficient number, since it is larger than the sum of its proper divisors (63564471256507).
132520404056645 is a wasteful number, since it uses less digits than its factorization.
132520404056645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224051.
The product of its (nonzero) digits is 3456000, while the sum is 47.
The spelling of 132520404056645 in words is "one hundred thirty-two trillion, five hundred twenty billion, four hundred four million, fifty-six thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •