Base | Representation |
---|---|
bin | 1001101110011000000000… |
… | …0110101111000010000101 |
3 | 1101212011202100210222002201 |
4 | 2123212000012233002011 |
5 | 2400140334122131101 |
6 | 34423552454234501 |
7 | 2152331504433151 |
oct | 233460006570205 |
9 | 41764670728081 |
10 | 10692322848901 |
11 | 3452652555441 |
12 | 12482b1355a31 |
13 | 5c7387c201b5 |
14 | 28d7229aa061 |
15 | 1381ea023e01 |
hex | 9b9801af085 |
10692322848901 has 8 divisors (see below), whose sum is σ = 10696674998240. Its totient is φ = 10687970978352.
The previous prime is 10692322848853. The next prime is 10692322848943. The reversal of 10692322848901 is 10984822329601.
It is a happy number.
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 10692322848901 - 213 = 10692322840709 is a prime.
It is a super-4 number, since 4×106923228489014 (a number of 53 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10692922848901) 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, 113011651 + ... + 113106223.
It is an arithmetic number, because the mean of its divisors is an integer number (1337084374780).
Almost surely, 210692322848901 is an apocalyptic number.
It is an amenable number.
10692322848901 is a deficient number, since it is larger than the sum of its proper divisors (4352149339).
10692322848901 is an equidigital number, since it uses as much as digits as its factorization.
10692322848901 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 139395.
The product of its (nonzero) digits is 2985984, while the sum is 55.
The spelling of 10692322848901 in words is "ten trillion, six hundred ninety-two billion, three hundred twenty-two million, eight hundred forty-eight thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •