Base | Representation |
---|---|
bin | 11110000001100110100011… |
… | …111101111000101001011111 |
3 | 122022120000001111121212201212 |
4 | 132001212203331320221133 |
5 | 114302013003212041133 |
6 | 1144503344144255035 |
7 | 36546256530455066 |
oct | 3601464375705137 |
9 | 568500044555655 |
10 | 132051520424543 |
11 | 3909180a781575 |
12 | 1298857701147b |
13 | 588b53587cc65 |
14 | 248748327b1dd |
15 | 103ee6a64c148 |
hex | 7819a3f78a5f |
132051520424543 has 32 divisors (see below), whose sum is σ = 138878786027520. Its totient is φ = 125318765658240.
The previous prime is 132051520424357. The next prime is 132051520424569. The reversal of 132051520424543 is 345424025150231.
It is a cyclic number.
It is not a de Polignac number, because 132051520424543 - 210 = 132051520423519 is a prime.
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 132051520424543.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132051520424573) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2664506798 + ... + 2664556356.
It is an arithmetic number, because the mean of its divisors is an integer number (4339962063360).
Almost surely, 2132051520424543 is an apocalyptic number.
132051520424543 is a deficient number, since it is larger than the sum of its proper divisors (6827265602977).
132051520424543 is a wasteful number, since it uses less digits than its factorization.
132051520424543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51407.
The product of its (nonzero) digits is 576000, while the sum is 41.
Adding to 132051520424543 its reverse (345424025150231), we get a palindrome (477475545574774).
The spelling of 132051520424543 in words is "one hundred thirty-two trillion, fifty-one billion, five hundred twenty million, four hundred twenty-four thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •