Base | Representation |
---|---|
bin | 1001110101100111… |
… | …1010000101011111 |
3 | 20211001011021100220 |
4 | 2131121322011133 |
5 | 20402022030211 |
6 | 1114013452423 |
7 | 122304360303 |
oct | 23531720537 |
9 | 6731137326 |
10 | 2640814431 |
11 | 1135741a72 |
12 | 6184a1113 |
13 | 3311633b8 |
14 | 1b0a27d03 |
15 | 106c93806 |
hex | 9d67a15f |
2640814431 has 16 divisors (see below), whose sum is σ = 3625154400. Its totient is φ = 1708743168.
The previous prime is 2640814417. The next prime is 2640814481. The reversal of 2640814431 is 1344180462.
It is not a de Polignac number, because 2640814431 - 27 = 2640814303 is a prime.
It is a super-2 number, since 2×26408144312 = 13947801717955707522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2640814392 and 2640814401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2640814481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16315 + ... + 74483.
It is an arithmetic number, because the mean of its divisors is an integer number (226572150).
Almost surely, 22640814431 is an apocalyptic number.
2640814431 is a deficient number, since it is larger than the sum of its proper divisors (984339969).
2640814431 is a wasteful number, since it uses less digits than its factorization.
2640814431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58618.
The product of its (nonzero) digits is 18432, while the sum is 33.
The square root of 2640814431 is about 51388.8551244334. The cubic root of 2640814431 is about 1382.2267541905.
Adding to 2640814431 its reverse (1344180462), we get a palindrome (3984994893).
The spelling of 2640814431 in words is "two billion, six hundred forty million, eight hundred fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •