Base | Representation |
---|---|
bin | 1001001010110000010010… |
… | …1110111111010110101101 |
3 | 1022200200012011011221012201 |
4 | 2102230010232333112231 |
5 | 2310124043110430301 |
6 | 33234505035101501 |
7 | 2060165623311166 |
oct | 222540456772655 |
9 | 38620164157181 |
10 | 10080367670701 |
11 | 3237072834589 |
12 | 11697868a1891 |
13 | 5817614c2663 |
14 | 26bc6ca5476d |
15 | 12733083b201 |
hex | 92b04bbf5ad |
10080367670701 has 4 divisors (see below), whose sum is σ = 10610913337600. Its totient is φ = 9549822003804.
The previous prime is 10080367670687. The next prime is 10080367670741. The reversal of 10080367670701 is 10707676308001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10080367670701 - 211 = 10080367668653 is a prime.
It is a super-2 number, since 2×100803676707012 (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 (10080367670741) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 265272833421 + ... + 265272833458.
It is an arithmetic number, because the mean of its divisors is an integer number (2652728334400).
Almost surely, 210080367670701 is an apocalyptic number.
It is an amenable number.
10080367670701 is a deficient number, since it is larger than the sum of its proper divisors (530545666899).
10080367670701 is an equidigital number, since it uses as much as digits as its factorization.
10080367670701 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 530545666898.
The product of its (nonzero) digits is 296352, while the sum is 46.
The spelling of 10080367670701 in words is "ten trillion, eighty billion, three hundred sixty-seven million, six hundred seventy thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •