Base | Representation |
---|---|
bin | 1001111110010000011010… |
… | …1111100111111001010001 |
3 | 1102211021000011210202102101 |
4 | 2133210012233213321101 |
5 | 2414123124122413121 |
6 | 35153154353120401 |
7 | 2211131000502304 |
oct | 237440657477121 |
9 | 42737004722371 |
10 | 10965164654161 |
11 | 3548333649aa3 |
12 | 1291157559101 |
13 | 61701a360393 |
14 | 29ca06c8ab3b |
15 | 140368300491 |
hex | 9f906be7e51 |
10965164654161 has 9 divisors (see below), whose sum is σ = 11122017259593. Its totient is φ = 10810493919540.
The previous prime is 10965164654137. The next prime is 10965164654167. The reversal of 10965164654161 is 16145646156901.
The square root of 10965164654161 is 3311369.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 10965164654161 - 219 = 10965164129873 is a prime.
It is a super-2 number, since 2×109651646541612 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10965164654167) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 235083880 + ... + 235130518.
Almost surely, 210965164654161 is an apocalyptic number.
10965164654161 is the 3311369-th square number.
10965164654161 is the 1655685-th centered octagonal number.
It is an amenable number.
10965164654161 is a deficient number, since it is larger than the sum of its proper divisors (156852605432).
10965164654161 is an frugal number, since it uses more digits than its factorization.
10965164654161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93420 (or 46710 counting only the distinct ones).
The product of its (nonzero) digits is 4665600, while the sum is 55.
The spelling of 10965164654161 in words is "ten trillion, nine hundred sixty-five billion, one hundred sixty-four million, six hundred fifty-four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •