Base | Representation |
---|---|
bin | 1001101100110010110011… |
… | …0101011100110011101101 |
3 | 1101202120122001121022101201 |
4 | 2123030230311130303231 |
5 | 2344214214414130401 |
6 | 34403301030405501 |
7 | 2150350336165003 |
oct | 233145465346355 |
9 | 41676561538351 |
10 | 10665156005101 |
11 | 3442081585614 |
12 | 1242b8b200891 |
13 | 5c49487c3ab0 |
14 | 28c2a6936a73 |
15 | 137659ed3b01 |
hex | 9b32cd5cced |
10665156005101 has 16 divisors (see below), whose sum is σ = 11498466838320. Its totient is φ = 9833696087040.
The previous prime is 10665156005093. The next prime is 10665156005113. The reversal of 10665156005101 is 10150065156601.
It can be written as a sum of positive squares in 8 ways, for example, as 2091708483076 + 8573447522025 = 1446274^2 + 2928045^2 .
It is a cyclic number.
It is not a de Polignac number, because 10665156005101 - 23 = 10665156005093 is a prime.
It is a super-2 number, since 2×106651560051012 (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 (10665156035101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42983685 + ... + 43231093.
It is an arithmetic number, because the mean of its divisors is an integer number (718654177395).
Almost surely, 210665156005101 is an apocalyptic number.
It is an amenable number.
10665156005101 is a deficient number, since it is larger than the sum of its proper divisors (833310833219).
10665156005101 is a wasteful number, since it uses less digits than its factorization.
10665156005101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251136.
The product of its (nonzero) digits is 27000, while the sum is 37.
The spelling of 10665156005101 in words is "ten trillion, six hundred sixty-five billion, one hundred fifty-six million, five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •