Base | Representation |
---|---|
bin | 110000100000011001111000… |
… | …1100101010001101000011001 |
3 | 2001221200212210101221211122001 |
4 | 1201000303301211101220121 |
5 | 421410444140142441431 |
6 | 4111235411414201001 |
7 | 155604415545215011 |
oct | 14100636145215031 |
9 | 2057625711854561 |
10 | 426666104265241 |
11 | 113a49095771545 |
12 | 3ba2a8bb053161 |
13 | 1540c596b1ca09 |
14 | 7750a6cdbcc41 |
15 | 344d87039de61 |
hex | 1840cf1951a19 |
426666104265241 has 8 divisors (see below), whose sum is σ = 441138544230600. Its totient is φ = 412348449754368.
The previous prime is 426666104265239. The next prime is 426666104265277. The reversal of 426666104265241 is 142562401666624.
It can be written as a sum of positive squares in 4 ways, for example, as 8079260499216 + 418586843766025 = 2842404^2 + 20459395^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 426666104265241 - 21 = 426666104265239 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (426666104265041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38696358016 + ... + 38696369041.
It is an arithmetic number, because the mean of its divisors is an integer number (55142318028825).
Almost surely, 2426666104265241 is an apocalyptic number.
It is an amenable number.
426666104265241 is a deficient number, since it is larger than the sum of its proper divisors (14472439965359).
426666104265241 is a wasteful number, since it uses less digits than its factorization.
426666104265241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77392727243.
The product of its (nonzero) digits is 19906560, while the sum is 55.
The spelling of 426666104265241 in words is "four hundred twenty-six trillion, six hundred sixty-six billion, one hundred four million, two hundred sixty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •