Base | Representation |
---|---|
bin | 10010101100011010010… |
… | …00111100000010010011 |
3 | 2021101221020202010020121 |
4 | 21112031020330002103 |
5 | 41010431410320434 |
6 | 1211024333051111 |
7 | 64256145256210 |
oct | 11261510740223 |
9 | 2241836663217 |
10 | 642318057619 |
11 | 228450886637 |
12 | a459b026a97 |
13 | 487550381a4 |
14 | 23134660b07 |
15 | 11a950e17b4 |
hex | 958d23c093 |
642318057619 has 4 divisors (see below), whose sum is σ = 734077780144. Its totient is φ = 550558335096.
The previous prime is 642318057551. The next prime is 642318057673. The reversal of 642318057619 is 916750813246.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 642318057619 - 211 = 642318055571 is a prime.
It is a super-2 number, since 2×6423180576192 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (642318007619) 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 3 ways as a sum of consecutive naturals, for example, 45879861252 + ... + 45879861265.
It is an arithmetic number, because the mean of its divisors is an integer number (183519445036).
It is a 1-persistent number, because it is pandigital, but 2⋅642318057619 = 1284636115238 is not.
Almost surely, 2642318057619 is an apocalyptic number.
642318057619 is a deficient number, since it is larger than the sum of its proper divisors (91759722525).
642318057619 is an equidigital number, since it uses as much as digits as its factorization.
642318057619 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91759722524.
The product of its (nonzero) digits is 2177280, while the sum is 52.
The spelling of 642318057619 in words is "six hundred forty-two billion, three hundred eighteen million, fifty-seven thousand, six hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •