Base | Representation |
---|---|
bin | 1001011111111101111111100… |
… | …0001001101100011000000001 |
3 | 10020122211222020120100200022001 |
4 | 2113333133320021230120001 |
5 | 1200104142122014212034 |
6 | 10325414120405344001 |
7 | 260542155350101351 |
oct | 22777377011543001 |
9 | 3218758216320261 |
10 | 668468578272769 |
11 | 183aa3a28549a6a |
12 | 62b81832408001 |
13 | 228cc416319b11 |
14 | bb100a2292b61 |
15 | 5243605ea7a14 |
hex | 25ff7f826c601 |
668468578272769 has 8 divisors (see below), whose sum is σ = 683090595375552. Its totient is φ = 654002946379920.
The previous prime is 668468578272611. The next prime is 668468578272793. The reversal of 668468578272769 is 967272875864866.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 668468578272769 - 237 = 668331139319297 is a prime.
It is a super-2 number, since 2×6684685782727692 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (668468578278769) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39096293842 + ... + 39096310939.
It is an arithmetic number, because the mean of its divisors is an integer number (85386324421944).
Almost surely, 2668468578272769 is an apocalyptic number.
It is an amenable number.
668468578272769 is a deficient number, since it is larger than the sum of its proper divisors (14622017102783).
668468578272769 is a wasteful number, since it uses less digits than its factorization.
668468578272769 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78192604967.
The product of its digits is 163870801920, while the sum is 91.
The spelling of 668468578272769 in words is "six hundred sixty-eight trillion, four hundred sixty-eight billion, five hundred seventy-eight million, two hundred seventy-two thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •