Base | Representation |
---|---|
bin | 1011111100010010100000… |
… | …10001000000000001001111 |
3 | 10102222111122200100001120222 |
4 | 11332021100101000001033 |
5 | 11420224032312302201 |
6 | 131504011222301555 |
7 | 5350164345531356 |
oct | 576112021000117 |
9 | 112874580301528 |
10 | 26260776681551 |
11 | 8405150902025 |
12 | 2b41620b878bb |
13 | 11864c429a059 |
14 | 66b057bda99d |
15 | 308182cb391b |
hex | 17e25044004f |
26260776681551 has 32 divisors (see below), whose sum is σ = 28642085714880. Its totient is φ = 23976456192000.
The previous prime is 26260776681479. The next prime is 26260776681553. The reversal of 26260776681551 is 15518667706262.
It is not a de Polignac number, because 26260776681551 - 218 = 26260776419407 is a prime.
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26260776681553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 545042780 + ... + 545090958.
It is an arithmetic number, because the mean of its divisors is an integer number (895065178590).
Almost surely, 226260776681551 is an apocalyptic number.
26260776681551 is a deficient number, since it is larger than the sum of its proper divisors (2381309033329).
26260776681551 is a wasteful number, since it uses less digits than its factorization.
26260776681551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50795.
The product of its (nonzero) digits is 50803200, while the sum is 62.
The spelling of 26260776681551 in words is "twenty-six trillion, two hundred sixty billion, seven hundred seventy-six million, six hundred eighty-one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.184 sec. • engine limits •