Base | Representation |
---|---|
bin | 11111000001001111110111… |
… | …10110011000101101001011 |
3 | 22221112001122110000000000000 |
4 | 33200213323312120231023 |
5 | 32420043401321402323 |
6 | 401024234123014043 |
7 | 20240124561360036 |
oct | 1740477366305513 |
9 | 287461573000000 |
10 | 68212600965963 |
11 | 1a80988aa457a3 |
12 | 779808606a323 |
13 | 2c0a56129c79c |
14 | 12bb71683001d |
15 | 7d457636be43 |
hex | 3e09fbd98b4b |
68212600965963 has 126 divisors (see below), whose sum is σ = 106229405995596. Its totient is φ = 43799560320600.
The previous prime is 68212600965911. The next prime is 68212600966001. The reversal of 68212600965963 is 36956900621286.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
68212600965963 is a `hidden beast` number, since 6 + 8 + 2 + 12 + 600 + 9 + 6 + 5 + 9 + 6 + 3 = 666.
It is not a de Polignac number, because 68212600965963 - 29 = 68212600965451 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 68212600965963.
It is not an unprimeable number, because it can be changed into a prime (68212600965463) by changing a digit.
It is a polite number, since it can be written in 125 ways as a sum of consecutive naturals, for example, 323282468928 + ... + 323282469138.
Almost surely, 268212600965963 is an apocalyptic number.
68212600965963 is a deficient number, since it is larger than the sum of its proper divisors (38016805029633).
68212600965963 is an frugal number, since it uses more digits than its factorization.
68212600965963 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523 (or 245 counting only the distinct ones).
The product of its (nonzero) digits is 50388480, while the sum is 63.
The spelling of 68212600965963 in words is "sixty-eight trillion, two hundred twelve billion, six hundred million, nine hundred sixty-five thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •