Base | Representation |
---|---|
bin | 111101111110… |
… | …0001011010101 |
3 | 2021010200011122 |
4 | 1323330023111 |
5 | 31304141242 |
6 | 3120213325 |
7 | 543106415 |
oct | 173741325 |
9 | 67120148 |
10 | 32490197 |
11 | 17381403 |
12 | aa6a245 |
13 | 696758c |
14 | 445a645 |
15 | 2cbbad2 |
hex | 1efc2d5 |
32490197 has 4 divisors (see below), whose sum is σ = 32616876. Its totient is φ = 32363520.
The previous prime is 32490173. The next prime is 32490203. The reversal of 32490197 is 79109423.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 79109423 = 797 ⋅99259.
It can be written as a sum of positive squares in 2 ways, for example, as 29528356 + 2961841 = 5434^2 + 1721^2 .
It is a cyclic number.
It is not a de Polignac number, because 32490197 - 214 = 32473813 is a prime.
It is a super-3 number, since 3×324901973 (a number of 24 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32490127) 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, 62954 + ... + 63467.
It is an arithmetic number, because the mean of its divisors is an integer number (8154219).
Almost surely, 232490197 is an apocalyptic number.
It is an amenable number.
32490197 is a deficient number, since it is larger than the sum of its proper divisors (126679).
32490197 is a wasteful number, since it uses less digits than its factorization.
32490197 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 126678.
The product of its (nonzero) digits is 13608, while the sum is 35.
The square root of 32490197 is about 5700.0172806756. The cubic root of 32490197 is about 319.0931257217.
The spelling of 32490197 in words is "thirty-two million, four hundred ninety thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •