Base | Representation |
---|---|
bin | 1100010110011001010… |
… | …01011111010010011011 |
3 | 1111120021222222211002102 |
4 | 12023030221133102123 |
5 | 23423022044120011 |
6 | 522534511354015 |
7 | 42441355245446 |
oct | 6131451372233 |
9 | 1446258884072 |
10 | 424340223131 |
11 | 153a63aa2290 |
12 | 6a2a682290b |
13 | 31027279736 |
14 | 16776a8265d |
15 | b0886e173b |
hex | 62cca5f49b |
424340223131 has 8 divisors (see below), whose sum is σ = 469436560128. Its totient is φ = 380330545000.
The previous prime is 424340223121. The next prime is 424340223163. The reversal of 424340223131 is 131322043424.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-424340223131 is a prime.
It is a super-2 number, since 2×4243402231312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 424340223094 and 424340223103.
It is not an unprimeable number, because it can be changed into a prime (424340223101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 271663895 + ... + 271665456.
It is an arithmetic number, because the mean of its divisors is an integer number (58679570016).
Almost surely, 2424340223131 is an apocalyptic number.
424340223131 is a deficient number, since it is larger than the sum of its proper divisors (45096336997).
424340223131 is a wasteful number, since it uses less digits than its factorization.
424340223131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 543329433.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 424340223131 its reverse (131322043424), we get a palindrome (555662266555).
The spelling of 424340223131 in words is "four hundred twenty-four billion, three hundred forty million, two hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •