Base | Representation |
---|---|
bin | 1001101100110010110010… |
… | …0000110110101010111011 |
3 | 1101202120121200110000020102 |
4 | 2123030230200312222323 |
5 | 2344214212023343021 |
6 | 34403300314550015 |
7 | 2150350242250136 |
oct | 233145440665273 |
9 | 41676550400212 |
10 | 10665150606011 |
11 | 3442079528160 |
12 | 1242b8943830b |
13 | 5c4947653475 |
14 | 28c2a5d2d21d |
15 | 1376597b900b |
hex | 9b32c836abb |
10665150606011 has 16 divisors (see below), whose sum is σ = 11815264140768. Its totient is φ = 9545606380800.
The previous prime is 10665150605987. The next prime is 10665150606023. The reversal of 10665150606011 is 11060605156601.
It is a cyclic number.
It is not a de Polignac number, because 10665150606011 - 26 = 10665150605947 is a prime.
It is a super-2 number, since 2×106651506060112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10665150606211) 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 15 ways as a sum of consecutive naturals, for example, 11475200 + ... + 12369741.
It is an arithmetic number, because the mean of its divisors is an integer number (738454008798).
Almost surely, 210665150606011 is an apocalyptic number.
10665150606011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10665150606011 is a deficient number, since it is larger than the sum of its proper divisors (1150113534757).
10665150606011 is a wasteful number, since it uses less digits than its factorization.
10665150606011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23845582.
The product of its (nonzero) digits is 32400, while the sum is 38.
The spelling of 10665150606011 in words is "ten trillion, six hundred sixty-five billion, one hundred fifty million, six hundred six thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •