Base | Representation |
---|---|
bin | 10010101101100100000… |
… | …10010111011001111010 |
3 | 2021110112101120022101000 |
4 | 21112302002113121322 |
5 | 41013213343413311 |
6 | 1211210005105430 |
7 | 64310403052260 |
oct | 11266202273172 |
9 | 2243471508330 |
10 | 642937091706 |
11 | 228739255058 |
12 | a47323b8276 |
13 | 48823369650 |
14 | 23192960430 |
15 | 11ace61e056 |
hex | 95b209767a |
642937091706 has 128 divisors (see below), whose sum is σ = 1759537704960. Its totient is φ = 169461948096.
The previous prime is 642937091677. The next prime is 642937091767. The reversal of 642937091706 is 607190739246.
It is a happy number.
642937091706 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8152395 + ... + 8230881.
It is an arithmetic number, because the mean of its divisors is an integer number (13746388320).
Almost surely, 2642937091706 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 642937091706, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (879768852480).
642937091706 is an abundant number, since it is smaller than the sum of its proper divisors (1116600613254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
642937091706 is a wasteful number, since it uses less digits than its factorization.
642937091706 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80185 (or 80179 counting only the distinct ones).
The product of its (nonzero) digits is 3429216, while the sum is 54.
The spelling of 642937091706 in words is "six hundred forty-two billion, nine hundred thirty-seven million, ninety-one thousand, seven hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •