Base | Representation |
---|---|
bin | 1111110001000… |
… | …10001000110101 |
3 | 100012212112011112 |
4 | 13320202020311 |
5 | 232324313110 |
6 | 21042444405 |
7 | 3164123564 |
oct | 770421065 |
9 | 305775145 |
10 | 132260405 |
11 | 68726222 |
12 | 38363705 |
13 | 2152a5c4 |
14 | 137cbbdb |
15 | b928405 |
hex | 7e22235 |
132260405 has 8 divisors (see below), whose sum is σ = 158940600. Its totient is φ = 105656256.
The previous prime is 132260399. The next prime is 132260407. The reversal of 132260405 is 504062231.
132260405 = T221 + T222 + ... + T929.
It can be written as a sum of positive squares in 4 ways, for example, as 1592644 + 130667761 = 1262^2 + 11431^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132260405 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132260407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15110 + ... + 22199.
It is an arithmetic number, because the mean of its divisors is an integer number (19867575).
Almost surely, 2132260405 is an apocalyptic number.
It is an amenable number.
132260405 is a deficient number, since it is larger than the sum of its proper divisors (26680195).
132260405 is an equidigital number, since it uses as much as digits as its factorization.
132260405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38023.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 132260405 is about 11500.4523824065. The cubic root of 132260405 is about 509.4989375863.
The spelling of 132260405 in words is "one hundred thirty-two million, two hundred sixty thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •