Base | Representation |
---|---|
bin | 1100001000010001110100… |
… | …10010110101111001000001 |
3 | 10111102212222001122010200121 |
4 | 12010020322102311321001 |
5 | 11444001220040113032 |
6 | 132421140343020241 |
7 | 5422016663040352 |
oct | 604107222657101 |
9 | 114385861563617 |
10 | 26672724926017 |
11 | 8553925956325 |
12 | 2ba942973a681 |
13 | 11b62c511b721 |
14 | 682d76b87d29 |
15 | 313c43607a97 |
hex | 18423a4b5e41 |
26672724926017 has 2 divisors, whose sum is σ = 26672724926018. Its totient is φ = 26672724926016.
The previous prime is 26672724925999. The next prime is 26672724926083. The reversal of 26672724926017 is 71062942727662.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 26665563704641 + 7161221376 = 5163871^2 + 84624^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-26672724926017 is a prime.
It is a super-2 number, since 2×266727249260172 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (26672754926017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13336362463008 + 13336362463009.
It is an arithmetic number, because the mean of its divisors is an integer number (13336362463009).
Almost surely, 226672724926017 is an apocalyptic number.
It is an amenable number.
26672724926017 is a deficient number, since it is larger than the sum of its proper divisors (1).
26672724926017 is an equidigital number, since it uses as much as digits as its factorization.
26672724926017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42674688, while the sum is 61.
The spelling of 26672724926017 in words is "twenty-six trillion, six hundred seventy-two billion, seven hundred twenty-four million, nine hundred twenty-six thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •