Base | Representation |
---|---|
bin | 1001110000000001101100… |
… | …1010011101001110111111 |
3 | 1101221212222121022200200002 |
4 | 2130000123022131032333 |
5 | 2401121440142044311 |
6 | 34445004024424515 |
7 | 2154354536161535 |
oct | 234003312351677 |
9 | 41855877280602 |
10 | 10720694096831 |
11 | 3463691369984 |
12 | 12518aa91813b |
13 | 5c9c59a23574 |
14 | 290c54998155 |
15 | 138d0ab6e93b |
hex | 9c01b29d3bf |
10720694096831 has 4 divisors (see below), whose sum is σ = 10815567496032. Its totient is φ = 10625820697632.
The previous prime is 10720694096803. The next prime is 10720694096837. The reversal of 10720694096831 is 13869049602701.
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 10720694096831 - 230 = 10719620355007 is a prime.
It is a super-2 number, since 2×107206940968312 (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 (10720694096837) 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, 47436699431 + ... + 47436699656.
It is an arithmetic number, because the mean of its divisors is an integer number (2703891874008).
Almost surely, 210720694096831 is an apocalyptic number.
10720694096831 is a deficient number, since it is larger than the sum of its proper divisors (94873399201).
10720694096831 is an equidigital number, since it uses as much as digits as its factorization.
10720694096831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94873399200.
The product of its (nonzero) digits is 3919104, while the sum is 56.
The spelling of 10720694096831 in words is "ten trillion, seven hundred twenty billion, six hundred ninety-four million, ninety-six thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •