Base | Representation |
---|---|
bin | 1100010110001000100… |
… | …11000011011011101111 |
3 | 1111112221020101001102000 |
4 | 12023010103003123233 |
5 | 23422230212433033 |
6 | 522512544503343 |
7 | 42435034363545 |
oct | 6130423033357 |
9 | 1445836331360 |
10 | 424200124143 |
11 | 1539a1a028a4 |
12 | 6a26791ab53 |
13 | 31004236323 |
14 | 16762213d95 |
15 | b07b26aa13 |
hex | 62c44c36ef |
424200124143 has 32 divisors (see below), whose sum is σ = 666767531520. Its totient is φ = 265622555520.
The previous prime is 424200124141. The next prime is 424200124169. The reversal of 424200124143 is 341421002424.
424200124143 is a `hidden beast` number, since 4 + 242 + 0 + 0 + 1 + 2 + 414 + 3 = 666.
It is not a de Polignac number, because 424200124143 - 21 = 424200124141 is a prime.
It is a super-2 number, since 2×4242001241432 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (424200124141) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 715755 + ... + 1166492.
It is an arithmetic number, because the mean of its divisors is an integer number (20836485360).
Almost surely, 2424200124143 is an apocalyptic number.
424200124143 is a deficient number, since it is larger than the sum of its proper divisors (242567407377).
424200124143 is a wasteful number, since it uses less digits than its factorization.
424200124143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1882764 (or 1882758 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 27.
Adding to 424200124143 its reverse (341421002424), we get a palindrome (765621126567).
The spelling of 424200124143 in words is "four hundred twenty-four billion, two hundred million, one hundred twenty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •