Base | Representation |
---|---|
bin | 1001100100110… |
… | …0110011000001 |
3 | 2210120100210001 |
4 | 2121030303001 |
5 | 40240113244 |
6 | 3552440001 |
7 | 665233600 |
oct | 231146301 |
9 | 83510701 |
10 | 40160449 |
11 | 2074015a |
12 | 11549001 |
13 | 84218a4 |
14 | 5495a37 |
15 | 37d45d4 |
hex | 264ccc1 |
40160449 has 12 divisors (see below), whose sum is σ = 47247300. Its totient is φ = 34032768.
The previous prime is 40160441. The next prime is 40160459. The reversal of 40160449 is 94406104.
It can be written as a sum of positive squares in 2 ways, for example, as 6890625 + 33269824 = 2625^2 + 5768^2 .
It is not a de Polignac number, because 40160449 - 23 = 40160441 is a prime.
It is a super-2 number, since 2×401604492 = 3225723327763202, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40160441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 244 + ... + 8965.
It is an arithmetic number, because the mean of its divisors is an integer number (3937275).
Almost surely, 240160449 is an apocalyptic number.
40160449 is a gapful number since it is divisible by the number (49) formed by its first and last digit.
It is an amenable number.
40160449 is a deficient number, since it is larger than the sum of its proper divisors (7086851).
40160449 is an equidigital number, since it uses as much as digits as its factorization.
40160449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9312 (or 9305 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 28.
The square root of 40160449 is about 6337.2272327888. The cubic root of 40160449 is about 342.4518525034.
The spelling of 40160449 in words is "forty million, one hundred sixty thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •