Base | Representation |
---|---|
bin | 1111101111001… |
… | …01000101111001 |
3 | 100012101211011122 |
4 | 13313211011321 |
5 | 232243312421 |
6 | 21033235025 |
7 | 3162032600 |
oct | 767450571 |
9 | 305354148 |
10 | 132010361 |
11 | 6857537a |
12 | 38262a75 |
13 | 21470852 |
14 | 13764a37 |
15 | b8c92ab |
hex | 7de5179 |
132010361 has 6 divisors (see below), whose sum is σ = 153563130. Its totient is φ = 113151696.
The previous prime is 132010337. The next prime is 132010367. The reversal of 132010361 is 163010231.
It can be written as a sum of positive squares in only one way, i.e., 131790400 + 219961 = 11480^2 + 469^2 .
It is not a de Polignac number, because 132010361 - 218 = 131748217 is a prime.
It is a super-2 number, since 2×1320103612 = 34853470822700642, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (132010367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1346996 + ... + 1347093.
It is an arithmetic number, because the mean of its divisors is an integer number (25593855).
Almost surely, 2132010361 is an apocalyptic number.
It is an amenable number.
132010361 is a deficient number, since it is larger than the sum of its proper divisors (21552769).
132010361 is an equidigital number, since it uses as much as digits as its factorization.
132010361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2694103 (or 2694096 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 132010361 is about 11489.5761888766. The cubic root of 132010361 is about 509.1776584651.
Adding to 132010361 its reverse (163010231), we get a palindrome (295020592).
The spelling of 132010361 in words is "one hundred thirty-two million, ten thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •