Base | Representation |
---|---|
bin | 11001001101100… |
… | …101011001001101 |
3 | 1002110221012011112 |
4 | 121031211121031 |
5 | 1331241211222 |
6 | 105550101405 |
7 | 13324240121 |
oct | 3115453115 |
9 | 1073835145 |
10 | 422991437 |
11 | 1a7849800 |
12 | b97aa865 |
13 | 698314bb |
14 | 4026b581 |
15 | 27205be2 |
hex | 1936564d |
422991437 has 24 divisors (see below), whose sum is σ = 482515488. Its totient is φ = 370228320.
The previous prime is 422991427. The next prime is 422991449. The reversal of 422991437 is 734199224.
It is not a de Polignac number, because 422991437 - 28 = 422991181 is a prime.
It is a super-3 number, since 3×4229914373 (a number of 27 digits) contains 333 as substring.
It is a Smith number, since the sum of its digits (41) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 422991394 and 422991403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (422991427) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 478598 + ... + 479480.
It is an arithmetic number, because the mean of its divisors is an integer number (20104812).
Almost surely, 2422991437 is an apocalyptic number.
It is an amenable number.
422991437 is a deficient number, since it is larger than the sum of its proper divisors (59524051).
422991437 is a wasteful number, since it uses less digits than its factorization.
422991437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1049 (or 1038 counting only the distinct ones).
The product of its digits is 108864, while the sum is 41.
The square root of 422991437 is about 20566.7556264959. The cubic root of 422991437 is about 750.6610095470.
The spelling of 422991437 in words is "four hundred twenty-two million, nine hundred ninety-one thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •