Base | Representation |
---|---|
bin | 10010101101001011110… |
… | …10011111010011110100 |
3 | 2021110000012211221212110 |
4 | 21112211322133103310 |
5 | 41012304311402330 |
6 | 1211133501451020 |
7 | 64302353211444 |
oct | 11264572372364 |
9 | 2243005757773 |
10 | 642733700340 |
11 | 228644466116 |
12 | a4696270a70 |
13 | 487c0195824 |
14 | 23173938124 |
15 | 11abb844db0 |
hex | 95a5e9f4f4 |
642733700340 has 48 divisors (see below), whose sum is σ = 1800940982400. Its totient is φ = 171273118080.
The previous prime is 642733700327. The next prime is 642733700341. The reversal of 642733700340 is 43007337246.
It is a super-2 number, since 2×6427337003402 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (642733700341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3744591 + ... + 3912470.
It is an arithmetic number, because the mean of its divisors is an integer number (37519603800).
Almost surely, 2642733700340 is an apocalyptic number.
642733700340 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
642733700340 is an abundant number, since it is smaller than the sum of its proper divisors (1158207282060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
642733700340 is a wasteful number, since it uses less digits than its factorization.
642733700340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7658472 (or 7658470 counting only the distinct ones).
The product of its (nonzero) digits is 254016, while the sum is 39.
The spelling of 642733700340 in words is "six hundred forty-two billion, seven hundred thirty-three million, seven hundred thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •