Base | Representation |
---|---|
bin | 11001000111001… |
… | …011011110110101 |
3 | 1002100202220000100 |
4 | 121013023132311 |
5 | 1330323444222 |
6 | 105450104313 |
7 | 13304045100 |
oct | 3107133665 |
9 | 1070686010 |
10 | 421312437 |
11 | 1a69022a7 |
12 | b911b099 |
13 | 69394200 |
14 | 3dd51737 |
15 | 26ec34ac |
hex | 191cb7b5 |
421312437 has 54 divisors (see below), whose sum is σ = 766699362. Its totient is φ = 222191424.
The previous prime is 421312429. The next prime is 421312439. The reversal of 421312437 is 734213124.
It is a happy number.
421312437 is a `hidden beast` number, since 4 + 213 + 12 + 437 = 666.
It can be written as a sum of positive squares in 3 ways, for example, as 9790641 + 411521796 = 3129^2 + 20286^2 .
It is not a de Polignac number, because 421312437 - 23 = 421312429 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 421312437.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (421312439) 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 53 ways as a sum of consecutive naturals, for example, 71703 + ... + 77355.
Almost surely, 2421312437 is an apocalyptic number.
It is an amenable number.
421312437 is a deficient number, since it is larger than the sum of its proper divisors (345386925).
421312437 is a wasteful number, since it uses less digits than its factorization.
421312437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5699 (or 5676 counting only the distinct ones).
The product of its digits is 4032, while the sum is 27.
The square root of 421312437 is about 20525.8967404594. The cubic root of 421312437 is about 749.6664810421. Note that the first 3 decimals are identical.
The spelling of 421312437 in words is "four hundred twenty-one million, three hundred twelve thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •