Base | Representation |
---|---|
bin | 1011111001011001111000… |
… | …11101011001111011001111 |
3 | 10102122000211002002010020100 |
4 | 11330230330131121323033 |
5 | 11412113034444010023 |
6 | 131350300055022143 |
7 | 5340055220042223 |
oct | 574547435317317 |
9 | 112560732063210 |
10 | 26161660141263 |
11 | 8377109131319 |
12 | 2b2637b06a953 |
13 | 117a05981254a |
14 | 66633422c783 |
15 | 3057d13d9c43 |
hex | 17cb3c759ecf |
26161660141263 has 12 divisors (see below), whose sum is σ = 37789794011320. Its totient is φ = 17440770131856.
The previous prime is 26161660141249. The next prime is 26161660141283. The reversal of 26161660141263 is 36214106616162.
26161660141263 is a `hidden beast` number, since 2 + 6 + 1 + 6 + 16 + 601 + 4 + 1 + 26 + 3 = 666.
It is not a de Polignac number, because 26161660141263 - 25 = 26161660141231 is a prime.
It is a super-2 number, since 2×261616601412632 (a number of 28 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 (26161660141283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 27559756 + ... + 28493217.
Almost surely, 226161660141263 is an apocalyptic number.
26161660141263 is a deficient number, since it is larger than the sum of its proper divisors (11628133870057).
26161660141263 is a wasteful number, since it uses less digits than its factorization.
26161660141263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56104838 (or 56104835 counting only the distinct ones).
The product of its (nonzero) digits is 373248, while the sum is 45.
The spelling of 26161660141263 in words is "twenty-six trillion, one hundred sixty-one billion, six hundred sixty million, one hundred forty-one thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •