Base | Representation |
---|---|
bin | 1011111001011001111000… |
… | …11101011001111010101111 |
3 | 10102122000211002002010012011 |
4 | 11330230330131121322233 |
5 | 11412113034444004411 |
6 | 131350300055022051 |
7 | 5340055220042146 |
oct | 574547435317257 |
9 | 112560732063164 |
10 | 26161660141231 |
11 | 837710913129a |
12 | 2b2637b06a927 |
13 | 117a059812524 |
14 | 66633422c75d |
15 | 3057d13d9c21 |
hex | 17cb3c759eaf |
26161660141231 has 2 divisors, whose sum is σ = 26161660141232. Its totient is φ = 26161660141230.
The previous prime is 26161660141181. The next prime is 26161660141249. The reversal of 26161660141231 is 13214106616162.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 26161660141231 - 227 = 26161525923503 is a prime.
It is a super-2 number, since 2×261616601412312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (26161660181231) 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 as a sum of consecutive naturals, namely, 13080830070615 + 13080830070616.
It is an arithmetic number, because the mean of its divisors is an integer number (13080830070616).
Almost surely, 226161660141231 is an apocalyptic number.
26161660141231 is a deficient number, since it is larger than the sum of its proper divisors (1).
26161660141231 is an equidigital number, since it uses as much as digits as its factorization.
26161660141231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62208, while the sum is 40.
Adding to 26161660141231 its reverse (13214106616162), we get a palindrome (39375766757393).
The spelling of 26161660141231 in words is "twenty-six trillion, one hundred sixty-one billion, six hundred sixty million, one hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •