Base | Representation |
---|---|
bin | 1010001001110111100111… |
… | …1101010001001100001101 |
3 | 1110112022221202222121021200 |
4 | 2202131321331101030031 |
5 | 2430410214010403022 |
6 | 35424550553420113 |
7 | 2231422556042061 |
oct | 242357175211415 |
9 | 43468852877250 |
10 | 11164666106637 |
11 | 36149a9a5604a |
12 | 130395410a639 |
13 | 62ca922b5604 |
14 | 2a8530a73aa1 |
15 | 145642ae6bac |
hex | a2779f5130d |
11164666106637 has 12 divisors (see below), whose sum is σ = 16129482184764. Its totient is φ = 7441845082560.
The previous prime is 11164666106621. The next prime is 11164666106641. The reversal of 11164666106637 is 73660166646111.
It can be written as a sum of positive squares in 2 ways, for example, as 7851170376036 + 3313495730601 = 2801994^2 + 1820301^2 .
It is not a de Polignac number, because 11164666106637 - 24 = 11164666106621 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11164666106617) 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 11 ways as a sum of consecutive naturals, for example, 105415398 + ... + 105521255.
It is an arithmetic number, because the mean of its divisors is an integer number (1344123515397).
Almost surely, 211164666106637 is an apocalyptic number.
It is an amenable number.
11164666106637 is a deficient number, since it is larger than the sum of its proper divisors (4964816078127).
11164666106637 is a wasteful number, since it uses less digits than its factorization.
11164666106637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210942540 (or 210942537 counting only the distinct ones).
The product of its (nonzero) digits is 3919104, while the sum is 54.
The spelling of 11164666106637 in words is "eleven trillion, one hundred sixty-four billion, six hundred sixty-six million, one hundred six thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •