Base | Representation |
---|---|
bin | 111101111110… |
… | …0010000001001 |
3 | 2021010200121001 |
4 | 1323330100021 |
5 | 31304144010 |
6 | 3120215001 |
7 | 543110335 |
oct | 173742011 |
9 | 67120531 |
10 | 32490505 |
11 | 17381663 |
12 | aa6a461 |
13 | 6967768 |
14 | 445a7c5 |
15 | 2cbbc3a |
hex | 1efc409 |
32490505 has 4 divisors (see below), whose sum is σ = 38988612. Its totient is φ = 25992400.
The previous prime is 32490503. The next prime is 32490529. The reversal of 32490505 is 50509423.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 50509423 = 4967 ⋅10169.
It can be written as a sum of positive squares in 2 ways, for example, as 14622976 + 17867529 = 3824^2 + 4227^2 .
It is not a de Polignac number, because 32490505 - 21 = 32490503 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32490503) 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 3 ways as a sum of consecutive naturals, for example, 3249046 + ... + 3249055.
It is an arithmetic number, because the mean of its divisors is an integer number (9747153).
Almost surely, 232490505 is an apocalyptic number.
It is an amenable number.
32490505 is a deficient number, since it is larger than the sum of its proper divisors (6498107).
32490505 is an equidigital number, since it uses as much as digits as its factorization.
32490505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6498106.
The product of its (nonzero) digits is 5400, while the sum is 28.
The square root of 32490505 is about 5700.0442980735. The cubic root of 32490505 is about 319.0941340297.
Adding to 32490505 its reverse (50509423), we get a palindrome (82999928).
The spelling of 32490505 in words is "thirty-two million, four hundred ninety thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •