Base | Representation |
---|---|
bin | 10010101000010011010… |
… | …10011001011001010001 |
3 | 2021012020112002202222210 |
4 | 21110021222121121101 |
5 | 40441422213023423 |
6 | 1210021414422333 |
7 | 64150402142550 |
oct | 11241152313121 |
9 | 2235215082883 |
10 | 640112236113 |
11 | 227519740259 |
12 | a40843619a9 |
13 | 48493048b6c |
14 | 22da5709d97 |
15 | 119b6624b93 |
hex | 9509a99651 |
640112236113 has 16 divisors (see below), whose sum is σ = 996162508800. Its totient is φ = 357995900496.
The previous prime is 640112236109. The next prime is 640112236123. The reversal of 640112236113 is 311632211046.
It is not a de Polignac number, because 640112236113 - 22 = 640112236109 is a prime.
It is a super-2 number, since 2×6401122361132 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (640112236123) 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, 324270663 + ... + 324272636.
It is an arithmetic number, because the mean of its divisors is an integer number (62260156800).
Almost surely, 2640112236113 is an apocalyptic number.
It is an amenable number.
640112236113 is a deficient number, since it is larger than the sum of its proper divisors (356050272687).
640112236113 is a wasteful number, since it uses less digits than its factorization.
640112236113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 648543356.
The product of its (nonzero) digits is 5184, while the sum is 30.
Adding to 640112236113 its reverse (311632211046), we get a palindrome (951744447159).
The spelling of 640112236113 in words is "six hundred forty billion, one hundred twelve million, two hundred thirty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •