Base | Representation |
---|---|
bin | 10010101100010011100… |
… | …11100000010111111011 |
3 | 2021101210100110120022021 |
4 | 21112021303200113323 |
5 | 41010323044421033 |
6 | 1211015013535311 |
7 | 64254565560562 |
oct | 11261163402773 |
9 | 2241710416267 |
10 | 642262107643 |
11 | 228422241592 |
12 | a4584344537 |
13 | 487465787b0 |
14 | 2312b058bd9 |
15 | 11a9023db2d |
hex | 9589ce05fb |
642262107643 has 8 divisors (see below), whose sum is σ = 732353172768. Its totient is φ = 557983369344.
The previous prime is 642262107587. The next prime is 642262107647. The reversal of 642262107643 is 346701262246.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 642262107643 - 29 = 642262107131 is a prime.
It is a super-2 number, since 2×6422621076432 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 642262107643.
It is not an unprimeable number, because it can be changed into a prime (642262107647) 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, 1453081471 + ... + 1453081912.
It is an arithmetic number, because the mean of its divisors is an integer number (91544146596).
Almost surely, 2642262107643 is an apocalyptic number.
642262107643 is a deficient number, since it is larger than the sum of its proper divisors (90091065125).
642262107643 is a wasteful number, since it uses less digits than its factorization.
642262107643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2906163413.
The product of its (nonzero) digits is 580608, while the sum is 43.
Adding to 642262107643 its reverse (346701262246), we get a palindrome (988963369889).
The spelling of 642262107643 in words is "six hundred forty-two billion, two hundred sixty-two million, one hundred seven thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •