Base | Representation |
---|---|
bin | 1001101100100100110100… |
… | …0010011111000111001111 |
3 | 1101202012221101111211222221 |
4 | 2123021031002133013033 |
5 | 2344134022214413111 |
6 | 34401440302520211 |
7 | 2150155315014541 |
oct | 233111502370717 |
9 | 41665841454887 |
10 | 10661401326031 |
11 | 3440525119665 |
12 | 1242301896067 |
13 | 5c449a9670c1 |
14 | 28c02c001691 |
15 | 1374da56b371 |
hex | 9b24d09f1cf |
10661401326031 has 4 divisors (see below), whose sum is σ = 10661422401864. Its totient is φ = 10661380250200.
The previous prime is 10661401326019. The next prime is 10661401326049. The reversal of 10661401326031 is 13062310416601.
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 10661401326031 - 27 = 10661401325903 is a prime.
It is a super-2 number, since 2×106614013260312 (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 (10661401323031) 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, 9759985 + ... + 10797226.
It is an arithmetic number, because the mean of its divisors is an integer number (2665355600466).
Almost surely, 210661401326031 is an apocalyptic number.
10661401326031 is a deficient number, since it is larger than the sum of its proper divisors (21075833).
10661401326031 is an equidigital number, since it uses as much as digits as its factorization.
10661401326031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21075832.
The product of its (nonzero) digits is 15552, while the sum is 34.
The spelling of 10661401326031 in words is "ten trillion, six hundred sixty-one billion, four hundred one million, three hundred twenty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •