Base | Representation |
---|---|
bin | 1001111010110101100101… |
… | …0101010000111111000001 |
3 | 1102121122101012201021020012 |
4 | 2132231121111100333001 |
5 | 2412142322200230421 |
6 | 35110201314354305 |
7 | 2203651162306040 |
oct | 236553125207701 |
9 | 42548335637205 |
10 | 10906420711361 |
11 | 352542918633a |
12 | 12818a228b995 |
13 | 611617bc3b06 |
14 | 299c3315a557 |
15 | 13da7aeac95b |
hex | 9eb59550fc1 |
10906420711361 has 8 divisors (see below), whose sum is σ = 12464698464960. Its totient is φ = 9348197370768.
The previous prime is 10906420711349. The next prime is 10906420711367. The reversal of 10906420711361 is 16311702460901.
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 10906420711361 - 214 = 10906420694977 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10906420711367) 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 7 ways as a sum of consecutive naturals, for example, 13172831 + ... + 13976276.
It is an arithmetic number, because the mean of its divisors is an integer number (1558087308120).
Almost surely, 210906420711361 is an apocalyptic number.
It is an amenable number.
10906420711361 is a deficient number, since it is larger than the sum of its proper divisors (1558277753599).
10906420711361 is an equidigital number, since it uses as much as digits as its factorization.
10906420711361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27206503.
The product of its (nonzero) digits is 54432, while the sum is 41.
The spelling of 10906420711361 in words is "ten trillion, nine hundred six billion, four hundred twenty million, seven hundred eleven thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •