Base | Representation |
---|---|
bin | 1001010010000111000111… |
… | …00011111100111101100010 |
3 | 2200021111211002021001211110 |
4 | 10221003203203330331202 |
5 | 10133423323111141422 |
6 | 111225500014324150 |
7 | 4204553422551660 |
oct | 451034343747542 |
9 | 80244732231743 |
10 | 20413502443362 |
11 | 6560354a4aa36 |
12 | 23583347b9656 |
13 | b50ca6123022 |
14 | 5080397b9c30 |
15 | 256006d7d60c |
hex | 1290e38fcf62 |
20413502443362 has 32 divisors (see below), whose sum is σ = 48688105208832. Its totient is φ = 5578845387984.
The previous prime is 20413502443333. The next prime is 20413502443423. The reversal of 20413502443362 is 26334420531402.
It is a super-2 number, since 2×204135024433622 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20413502443362.
It is an unprimeable number.
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, 10565994088 + ... + 10565996019.
It is an arithmetic number, because the mean of its divisors is an integer number (1521503287776).
Almost surely, 220413502443362 is an apocalyptic number.
20413502443362 is an abundant number, since it is smaller than the sum of its proper divisors (28274602765470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20413502443362 is a wasteful number, since it uses less digits than its factorization.
20413502443362 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21131990142.
The product of its (nonzero) digits is 414720, while the sum is 39.
Adding to 20413502443362 its reverse (26334420531402), we get a palindrome (46747922974764).
The spelling of 20413502443362 in words is "twenty trillion, four hundred thirteen billion, five hundred two million, four hundred forty-three thousand, three hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •