Base | Representation |
---|---|
bin | 1000010110110111… |
… | …1111100010000101 |
3 | 12210100101212112001 |
4 | 2011231333202011 |
5 | 14043304121222 |
6 | 1010340225301 |
7 | 106410544600 |
oct | 20555774205 |
9 | 5710355461 |
10 | 2243426437 |
11 | a513a053a |
12 | 52739b231 |
13 | 299a27985 |
14 | 173d43337 |
15 | d1e48e27 |
hex | 85b7f885 |
2243426437 has 48 divisors (see below), whose sum is σ = 2842594560. Its totient is φ = 1758661632.
The previous prime is 2243426389. The next prime is 2243426447. The reversal of 2243426437 is 7346243422.
It is not a de Polignac number, because 2243426437 - 27 = 2243426309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2243426396 and 2243426405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2243426447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4803678 + ... + 4804144.
It is an arithmetic number, because the mean of its divisors is an integer number (59220720).
Almost surely, 22243426437 is an apocalyptic number.
It is an amenable number.
2243426437 is a deficient number, since it is larger than the sum of its proper divisors (599168123).
2243426437 is a wasteful number, since it uses less digits than its factorization.
2243426437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 650 (or 643 counting only the distinct ones).
The product of its digits is 193536, while the sum is 37.
The square root of 2243426437 is about 47364.8227802026. The cubic root of 2243426437 is about 1309.0933331603.
Adding to 2243426437 its reverse (7346243422), we get a palindrome (9589669859).
The spelling of 2243426437 in words is "two billion, two hundred forty-three million, four hundred twenty-six thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •