Base | Representation |
---|---|
bin | 1001101101100110110100… |
… | …1111101110111001110111 |
3 | 1101210220200100012220221002 |
4 | 2123121231033232321313 |
5 | 2344431320103214204 |
6 | 34413530512313515 |
7 | 2151353405233226 |
oct | 233315517567167 |
9 | 41726610186832 |
10 | 10679121538679 |
11 | 3447a98782700 |
12 | 124582824289b |
13 | 5c6062c25a29 |
14 | 28cc2d5dacbd |
15 | 137bc60a991e |
hex | 9b66d3eee77 |
10679121538679 has 12 divisors (see below), whose sum is σ = 11738907626880. Its totient is φ = 9707713646400.
The previous prime is 10679121538667. The next prime is 10679121538693. The reversal of 10679121538679 is 97683512197601.
It is not a de Polignac number, because 10679121538679 - 24 = 10679121538663 is a prime.
It is a super-2 number, since 2×106791215386792 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10679121538699) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 585314 + ... + 4658415.
It is an arithmetic number, because the mean of its divisors is an integer number (978242302240).
Almost surely, 210679121538679 is an apocalyptic number.
10679121538679 is a deficient number, since it is larger than the sum of its proper divisors (1059786088201).
10679121538679 is a wasteful number, since it uses less digits than its factorization.
10679121538679 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5260582 (or 5260571 counting only the distinct ones).
The product of its (nonzero) digits is 34292160, while the sum is 65.
The spelling of 10679121538679 in words is "ten trillion, six hundred seventy-nine billion, one hundred twenty-one million, five hundred thirty-eight thousand, six hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •