Base | Representation |
---|---|
bin | 1111101111011… |
… | …11000000111101 |
3 | 100012110212220222 |
4 | 13313233000331 |
5 | 232301113010 |
6 | 21034151125 |
7 | 3162262232 |
oct | 767570075 |
9 | 305425828 |
10 | 132051005 |
11 | 685a2969 |
12 | 382824a5 |
13 | 214861b8 |
14 | 13775789 |
15 | b8d6355 |
hex | 7def03d |
132051005 has 4 divisors (see below), whose sum is σ = 158461212. Its totient is φ = 105640800.
The previous prime is 132051001. The next prime is 132051061. The reversal of 132051005 is 500150231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 500150231 = 7 ⋅71450033.
It can be written as a sum of positive squares in 2 ways, for example, as 41306329 + 90744676 = 6427^2 + 9526^2 .
It is not a de Polignac number, because 132051005 - 22 = 132051001 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132051001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13205096 + ... + 13205105.
It is an arithmetic number, because the mean of its divisors is an integer number (39615303).
Almost surely, 2132051005 is an apocalyptic number.
It is an amenable number.
132051005 is a deficient number, since it is larger than the sum of its proper divisors (26410207).
132051005 is an equidigital number, since it uses as much as digits as its factorization.
132051005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26410206.
The product of its (nonzero) digits is 150, while the sum is 17.
The square root of 132051005 is about 11491.3447864034. The cubic root of 132051005 is about 509.2299091447.
It can be divided in two parts, 1320 and 51005, that added together give a palindrome (52325).
The spelling of 132051005 in words is "one hundred thirty-two million, fifty-one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •