Base | Representation |
---|---|
bin | 10010110101101010110100… |
… | …10111001111011000010000 |
3 | 12102200022222022110020021010 |
4 | 21122311122113033120100 |
5 | 20412212410224033124 |
6 | 224035020555130520 |
7 | 11503651453506003 |
oct | 1132653227173020 |
9 | 172608868406233 |
10 | 41426475611664 |
11 | 12221962551260 |
12 | 479088aa43a40 |
13 | 1a1666633b430 |
14 | a330a302353a |
15 | 4bc8e737c529 |
hex | 25ad5a5cf610 |
41426475611664 has 80 divisors (see below), whose sum is σ = 125727905024064. Its totient is φ = 11587825344000.
The previous prime is 41426475611663. The next prime is 41426475611693. The reversal of 41426475611664 is 46611657462414.
41426475611664 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (41426475611663) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3017655987 + ... + 3017669714.
Almost surely, 241426475611664 is an apocalyptic number.
41426475611664 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
41426475611664 is an abundant number, since it is smaller than the sum of its proper divisors (84301429412400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41426475611664 is a wasteful number, since it uses less digits than its factorization.
41426475611664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6035325736 (or 6035325730 counting only the distinct ones).
The product of its digits is 23224320, while the sum is 57.
The spelling of 41426475611664 in words is "forty-one trillion, four hundred twenty-six billion, four hundred seventy-five million, six hundred eleven thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •