Base | Representation |
---|---|
bin | 1001100000001011110100101… |
… | …0011101101011010100101110 |
3 | 10020200200200112121112012112110 |
4 | 2120002331022131223110232 |
5 | 1200122040230201204314 |
6 | 10330115213531344450 |
7 | 260565266404165536 |
oct | 23002751235532456 |
9 | 3220620477465473 |
10 | 668706182444334 |
11 | 184085776945901 |
12 | 62bbb8a35b2126 |
13 | 22918951233588 |
14 | bb1b7a268a4c6 |
15 | 52498b0913a59 |
hex | 2602f4a76b52e |
668706182444334 has 32 divisors (see below), whose sum is σ = 1338941695967136. Its totient is φ = 222647298030080.
The previous prime is 668706182444327. The next prime is 668706182444341. The reversal of 668706182444334 is 433444281607866.
668706182444334 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (668706182444327) and next prime (668706182444341).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5563354 + ... + 36991394.
It is an arithmetic number, because the mean of its divisors is an integer number (41841927998973).
Almost surely, 2668706182444334 is an apocalyptic number.
668706182444334 is an abundant number, since it is smaller than the sum of its proper divisors (670235513522802).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
668706182444334 is a wasteful number, since it uses less digits than its factorization.
668706182444334 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31432100.
The product of its (nonzero) digits is 445906944, while the sum is 66.
The spelling of 668706182444334 in words is "six hundred sixty-eight trillion, seven hundred six billion, one hundred eighty-two million, four hundred forty-four thousand, three hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •