Base | Representation |
---|---|
bin | 1001101101101010011110… |
… | …1000100101100110001011 |
3 | 1101211000012121111110021111 |
4 | 2123122213220211212023 |
5 | 2344440321342221213 |
6 | 34414212024351151 |
7 | 2151416601524353 |
oct | 233324750454613 |
9 | 41730177443244 |
10 | 10680101132683 |
11 | 3448450729124 |
12 | 1245a603154b7 |
13 | 5c618ab69a58 |
14 | 28ccc3755b63 |
15 | 137c320a9a3d |
hex | 9b6a7a2598b |
10680101132683 has 4 divisors (see below), whose sum is σ = 11308342375800. Its totient is φ = 10051859889568.
The previous prime is 10680101132647. The next prime is 10680101132713. The reversal of 10680101132683 is 38623110108601.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10680101132683 - 29 = 10680101132171 is a prime.
It is a super-2 number, since 2×106801011326832 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10680101132383) 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 3 ways as a sum of consecutive naturals, for example, 314120621533 + ... + 314120621566.
It is an arithmetic number, because the mean of its divisors is an integer number (2827085593950).
Almost surely, 210680101132683 is an apocalyptic number.
10680101132683 is a deficient number, since it is larger than the sum of its proper divisors (628241243117).
10680101132683 is an equidigital number, since it uses as much as digits as its factorization.
10680101132683 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 628241243116.
The product of its (nonzero) digits is 41472, while the sum is 40.
The spelling of 10680101132683 in words is "ten trillion, six hundred eighty billion, one hundred one million, one hundred thirty-two thousand, six hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •