Base | Representation |
---|---|
bin | 10100110000011101010… |
… | …001011010011011100001 |
3 | 12001100211200100100212102 |
4 | 110300131101122123201 |
5 | 141332302040334431 |
6 | 3011142144140145 |
7 | 205025011020014 |
oct | 24603521323341 |
9 | 5040750310772 |
10 | 1426420246241 |
11 | 4aaa3a051341 |
12 | 1b0549307655 |
13 | a468445a383 |
14 | 4d07945537b |
15 | 27187875dcb |
hex | 14c1d45a6e1 |
1426420246241 has 8 divisors (see below), whose sum is σ = 1431501731904. Its totient is φ = 1421339050800.
The previous prime is 1426420246187. The next prime is 1426420246297.
1426420246241 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1426420246241 - 218 = 1426419984097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1426420246195 and 1426420246204.
It is not an unprimeable number, because it can be changed into a prime (1426420248241) 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 in 7 ways as a sum of consecutive naturals, for example, 16413395 + ... + 16500071.
It is an arithmetic number, because the mean of its divisors is an integer number (178937716488).
Almost surely, 21426420246241 is an apocalyptic number.
It is an amenable number.
1426420246241 is a deficient number, since it is larger than the sum of its proper divisors (5081485663).
1426420246241 is an equidigital number, since it uses as much as digits as its factorization.
1426420246241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145111.
The product of its (nonzero) digits is 147456, while the sum is 38.
The spelling of 1426420246241 in words is "one trillion, four hundred twenty-six billion, four hundred twenty million, two hundred forty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •