Base | Representation |
---|---|
bin | 1110100101010001010111… |
… | …10000010001011101101110 |
3 | 11012112120102120102022021112 |
4 | 13102220223300101131232 |
5 | 13200341113214003140 |
6 | 152111205155232022 |
7 | 6516522105614123 |
oct | 722505360213556 |
9 | 135476376368245 |
10 | 32066959906670 |
11 | a243580979887 |
12 | 371a95bba8612 |
13 | 14b7b94339570 |
14 | 7cc098bb074a |
15 | 3a9206553c65 |
hex | 1d2a2bc1176e |
32066959906670 has 32 divisors (see below), whose sum is σ = 65432177304480. Its totient is φ = 11216944679040.
The previous prime is 32066959906591. The next prime is 32066959906679. The reversal of 32066959906670 is 7660995966023.
It is a super-2 number, since 2×320669599066702 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 32066959906670.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32066959906679) 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, 6491284961 + ... + 6491289900.
It is an arithmetic number, because the mean of its divisors is an integer number (2044755540765).
Almost surely, 232066959906670 is an apocalyptic number.
32066959906670 is an abundant number, since it is smaller than the sum of its proper divisors (33365217397810).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32066959906670 is a wasteful number, since it uses less digits than its factorization.
32066959906670 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12982574900.
The product of its (nonzero) digits is 198404640, while the sum is 68.
The spelling of 32066959906670 in words is "thirty-two trillion, sixty-six billion, nine hundred fifty-nine million, nine hundred six thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •