Base | Representation |
---|---|
bin | 100110010001100… |
… | …001000100100110 |
3 | 1122202021101102211 |
4 | 212101201010212 |
5 | 2303341013433 |
6 | 143414554034 |
7 | 21624660544 |
oct | 4621410446 |
9 | 1582241384 |
10 | 642126118 |
11 | 2aa510947 |
12 | 15b06891a |
13 | a30580aa |
14 | 613d0d94 |
15 | 3b58e8cd |
hex | 26461126 |
642126118 has 4 divisors (see below), whose sum is σ = 963189180. Its totient is φ = 321063058.
The previous prime is 642126113. The next prime is 642126127. The reversal of 642126118 is 811621246.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 811621246 = 2 ⋅405810623.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 642126118.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (642126113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160531528 + ... + 160531531.
It is an arithmetic number, because the mean of its divisors is an integer number (240797295).
Almost surely, 2642126118 is an apocalyptic number.
642126118 is a deficient number, since it is larger than the sum of its proper divisors (321063062).
642126118 is a wasteful number, since it uses less digits than its factorization.
642126118 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321063061.
The product of its digits is 4608, while the sum is 31.
The square root of 642126118 is about 25340.2075366403. The cubic root of 642126118 is about 862.7271092196.
The spelling of 642126118 in words is "six hundred forty-two million, one hundred twenty-six thousand, one hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •