Base | Representation |
---|---|
bin | 1001101100010… |
… | …0101011100101 |
3 | 2211111022100212 |
4 | 2123010223211 |
5 | 40401321433 |
6 | 4011145205 |
7 | 1002350321 |
oct | 233045345 |
9 | 84438325 |
10 | 40651493 |
11 | 20a46083 |
12 | 11745205 |
13 | 856424c |
14 | 5582981 |
15 | 387ed48 |
hex | 26c4ae5 |
40651493 has 4 divisors (see below), whose sum is σ = 41750220. Its totient is φ = 39552768.
The previous prime is 40651487. The next prime is 40651537. The reversal of 40651493 is 39415604.
40651493 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 21141604 + 19509889 = 4598^2 + 4417^2 .
It is a cyclic number.
It is not a de Polignac number, because 40651493 - 222 = 36457189 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40651423) 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, 549308 + ... + 549381.
It is an arithmetic number, because the mean of its divisors is an integer number (10437555).
Almost surely, 240651493 is an apocalyptic number.
It is an amenable number.
40651493 is a deficient number, since it is larger than the sum of its proper divisors (1098727).
40651493 is a wasteful number, since it uses less digits than its factorization.
40651493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1098726.
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 40651493 is about 6375.8523351784. The cubic root of 40651493 is about 343.8419281190.
The spelling of 40651493 in words is "forty million, six hundred fifty-one thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •