Base | Representation |
---|---|
bin | 11110000001100110000111… |
… | …100010101001010111010011 |
3 | 122022112221211021020201102211 |
4 | 132001212013202221113103 |
5 | 114302011014120201003 |
6 | 1144503224550452551 |
7 | 36546241650040504 |
oct | 3601460742512723 |
9 | 568487737221384 |
10 | 132051043522003 |
11 | 39091595560641 |
12 | 12988463364157 |
13 | 588b48ab240c8 |
14 | 2487439bb8bab |
15 | 103ee3d84796d |
hex | 7819878a95d3 |
132051043522003 has 8 divisors (see below), whose sum is σ = 134661518597088. Its totient is φ = 129462232140864.
The previous prime is 132051043521997. The next prime is 132051043522031. The reversal of 132051043522003 is 300225340150231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132051043522003 - 225 = 132051009967571 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132051043522043) 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, 5415911176 + ... + 5415935557.
It is an arithmetic number, because the mean of its divisors is an integer number (16832689824636).
Almost surely, 2132051043522003 is an apocalyptic number.
132051043522003 is a deficient number, since it is larger than the sum of its proper divisors (2610475075085).
132051043522003 is a wasteful number, since it uses less digits than its factorization.
132051043522003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10831846973.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 132051043522003 its reverse (300225340150231), we get a palindrome (432276383672234).
The spelling of 132051043522003 in words is "one hundred thirty-two trillion, fifty-one billion, forty-three million, five hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •