Base | Representation |
---|---|
bin | 1001000110001101100000… |
… | …11010100010111101101000 |
3 | 2121211102102112102010002202 |
4 | 10203012300122202331220 |
5 | 10110223431321241230 |
6 | 110313555141115332 |
7 | 4133200123123052 |
oct | 443066032427550 |
9 | 77742375363082 |
10 | 20004622446440 |
11 | 6412a04940505 |
12 | 22b10436b8b48 |
13 | b21573b5cb48 |
14 | 4d232c11c8d2 |
15 | 24a575aaea45 |
hex | 1231b06a2f68 |
20004622446440 has 16 divisors (see below), whose sum is σ = 45010400504580. Its totient is φ = 8001848978560.
The previous prime is 20004622446437. The next prime is 20004622446517. The reversal of 20004622446440 is 4464422640002.
It can be written as a sum of positive squares in 2 ways, for example, as 19895578518916 + 109043927524 = 4460446^2 + 330218^2 .
It is a super-2 number, since 2×200046224464402 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20004622446394 and 20004622446403.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 250057780541 + ... + 250057780620.
Almost surely, 220004622446440 is an apocalyptic number.
20004622446440 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20004622446440 is an abundant number, since it is smaller than the sum of its proper divisors (25005778058140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20004622446440 is a wasteful number, since it uses less digits than its factorization.
20004622446440 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 500115561172 (or 500115561168 counting only the distinct ones).
The product of its (nonzero) digits is 294912, while the sum is 38.
The spelling of 20004622446440 in words is "twenty trillion, four billion, six hundred twenty-two million, four hundred forty-six thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •