Base | Representation |
---|---|
bin | 100110010001110… |
… | …110101011100111 |
3 | 1122202102212212002 |
4 | 212101312223213 |
5 | 2303401332011 |
6 | 143420515515 |
7 | 21625506602 |
oct | 4621665347 |
9 | 1582385762 |
10 | 642214631 |
11 | 2aa5713a3 |
12 | 15b0abb9b |
13 | a3089476 |
14 | 61415339 |
15 | 3b5aac3b |
hex | 26476ae7 |
642214631 has 16 divisors (see below), whose sum is σ = 676144128. Its totient is φ = 609206400.
The previous prime is 642214613. The next prime is 642214637. The reversal of 642214631 is 136412246.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-642214631 is a prime.
It is a super-2 number, since 2×6422146312 = 824879264540932322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 642214594 and 642214603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (642214637) 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 15 ways as a sum of consecutive naturals, for example, 499916 + ... + 501198.
It is an arithmetic number, because the mean of its divisors is an integer number (42259008).
Almost surely, 2642214631 is an apocalyptic number.
642214631 is a deficient number, since it is larger than the sum of its proper divisors (33929497).
642214631 is a wasteful number, since it uses less digits than its factorization.
642214631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1622.
The product of its digits is 6912, while the sum is 29.
The square root of 642214631 is about 25341.9539696528. The cubic root of 642214631 is about 862.7667478794.
Adding to 642214631 its reverse (136412246), we get a palindrome (778626877).
The spelling of 642214631 in words is "six hundred forty-two million, two hundred fourteen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •