Base | Representation |
---|---|
bin | 1011110110101110001100… |
… | …10101000110001001000001 |
3 | 10102022012220011021211221211 |
4 | 11323113012111012021001 |
5 | 11404110300342011434 |
6 | 131240053335050121 |
7 | 5330313054201634 |
oct | 573270625061101 |
9 | 112265804254854 |
10 | 26069483938369 |
11 | 8341008064843 |
12 | 2b10535510941 |
13 | 1171459ba1461 |
14 | 661aac2c9c1b |
15 | 3031d8e92464 |
hex | 17b5c6546241 |
26069483938369 has 2 divisors, whose sum is σ = 26069483938370. Its totient is φ = 26069483938368.
The previous prime is 26069483938343. The next prime is 26069483938411. The reversal of 26069483938369 is 96383938496062.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20017687136769 + 6051796801600 = 4474113^2 + 2460040^2 .
It is a cyclic number.
It is not a de Polignac number, because 26069483938369 - 227 = 26069349720641 is a prime.
It is a super-2 number, since 2×260694839383692 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 26069483938295 and 26069483938304.
It is not a weakly prime, because it can be changed into another prime (26069483938339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13034741969184 + 13034741969185.
It is an arithmetic number, because the mean of its divisors is an integer number (13034741969185).
Almost surely, 226069483938369 is an apocalyptic number.
It is an amenable number.
26069483938369 is a deficient number, since it is larger than the sum of its proper divisors (1).
26069483938369 is an equidigital number, since it uses as much as digits as its factorization.
26069483938369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2176782336, while the sum is 76.
The spelling of 26069483938369 in words is "twenty-six trillion, sixty-nine billion, four hundred eighty-three million, nine hundred thirty-eight thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •