Base | Representation |
---|---|
bin | 111101101111110110… |
… | …1101110110000000101 |
3 | 110200021021200002211001 |
4 | 1323133231232300011 |
5 | 4133032143413041 |
6 | 140530000013301 |
7 | 12403003113454 |
oct | 1733755566005 |
9 | 420237602731 |
10 | 132602326021 |
11 | 512666131a0 |
12 | 21848301231 |
13 | c673080409 |
14 | 65bcd54b9b |
15 | 36b1553131 |
hex | 1edfb6ec05 |
132602326021 has 4 divisors (see below), whose sum is σ = 144657082944. Its totient is φ = 120547569100.
The previous prime is 132602326007. The next prime is 132602326057. The reversal of 132602326021 is 120623206231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 132602326021 - 29 = 132602325509 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132602326061) 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 3 ways as a sum of consecutive naturals, for example, 6027378445 + ... + 6027378466.
It is an arithmetic number, because the mean of its divisors is an integer number (36164270736).
Almost surely, 2132602326021 is an apocalyptic number.
132602326021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
132602326021 is a deficient number, since it is larger than the sum of its proper divisors (12054756923).
132602326021 is a wasteful number, since it uses less digits than its factorization.
132602326021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12054756922.
The product of its (nonzero) digits is 5184, while the sum is 28.
The spelling of 132602326021 in words is "one hundred thirty-two billion, six hundred two million, three hundred twenty-six thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •