Base | Representation |
---|---|
bin | 1001101101111010111011… |
… | …0010101111000011101001 |
3 | 1101211102121022020010222110 |
4 | 2123132232302233003221 |
5 | 2400023342121410211 |
6 | 34420222102512533 |
7 | 2151634162140621 |
oct | 233365662570351 |
9 | 41742538203873 |
10 | 10684516200681 |
11 | 344a30693a054 |
12 | 1246892a35749 |
13 | 5c671277731b |
14 | 28d1c1c73881 |
15 | 137dde9bcea6 |
hex | 9b7aecaf0e9 |
10684516200681 has 8 divisors (see below), whose sum is σ = 14247319214880. Its totient is φ = 7122361993472.
The previous prime is 10684516200647. The next prime is 10684516200703. The reversal of 10684516200681 is 18600261548601.
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 10684516200681 - 229 = 10683979329769 is a prime.
It is a super-2 number, since 2×106845162006812 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10684516200681.
It is not an unprimeable number, because it can be changed into a prime (10684516220681) 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, 162163320 + ... + 162229193.
It is an arithmetic number, because the mean of its divisors is an integer number (1780914901860).
Almost surely, 210684516200681 is an apocalyptic number.
It is an amenable number.
10684516200681 is a deficient number, since it is larger than the sum of its proper divisors (3562803014199).
10684516200681 is a wasteful number, since it uses less digits than its factorization.
10684516200681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 324403495.
The product of its (nonzero) digits is 552960, while the sum is 48.
The spelling of 10684516200681 in words is "ten trillion, six hundred eighty-four billion, five hundred sixteen million, two hundred thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.194 sec. • engine limits •