Base | Representation |
---|---|
bin | 1001000110001101001000… |
… | …11101111111110000110001 |
3 | 2121211101220120021121112100 |
4 | 10203012210131333300301 |
5 | 10110223024014233431 |
6 | 110313523221251013 |
7 | 4133162140426554 |
oct | 443064435776061 |
9 | 77741816247470 |
10 | 20004422024241 |
11 | 641291179a326 |
12 | 22b0ba8563a69 |
13 | b21541488625 |
14 | 4d230d66a69b |
15 | 24a5631c04e6 |
hex | 1231a477fc31 |
20004422024241 has 6 divisors (see below), whose sum is σ = 28895276257250. Its totient is φ = 13336281349488.
The previous prime is 20004422024183. The next prime is 20004422024297. The reversal of 20004422024241 is 14242022440002.
It can be written as a sum of positive squares in only one way, i.e., 18057434355216 + 1946987669025 = 4249404^2 + 1395345^2 .
It is not a de Polignac number, because 20004422024241 - 27 = 20004422024113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20004422025241) 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 5 ways as a sum of consecutive naturals, for example, 1111356779116 + ... + 1111356779133.
Almost surely, 220004422024241 is an apocalyptic number.
It is an amenable number.
20004422024241 is a deficient number, since it is larger than the sum of its proper divisors (8890854233009).
20004422024241 is a wasteful number, since it uses less digits than its factorization.
20004422024241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2222713558255 (or 2222713558252 counting only the distinct ones).
The product of its (nonzero) digits is 8192, while the sum is 27.
Adding to 20004422024241 its reverse (14242022440002), we get a palindrome (34246444464243).
The spelling of 20004422024241 in words is "twenty trillion, four billion, four hundred twenty-two million, twenty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •