Base | Representation |
---|---|
bin | 1001010010000011000000… |
… | …11111010011101010010010 |
3 | 2200021022010211101121121022 |
4 | 10221001200133103222102 |
5 | 10133404322133112242 |
6 | 111224453501355442 |
7 | 4204445061230636 |
oct | 451014037235222 |
9 | 80238124347538 |
10 | 20411303410322 |
11 | 655a426720960 |
12 | 2357a20268b82 |
13 | b50a1566c846 |
14 | 507cab710dc6 |
15 | 255e28ca30d2 |
hex | 1290607d3a92 |
20411303410322 has 32 divisors (see below), whose sum is σ = 33503450632704. Its totient is φ = 9249222931200.
The previous prime is 20411303410291. The next prime is 20411303410361. The reversal of 20411303410322 is 22301430311402.
It is a super-2 number, since 2×204113034103222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20411303410291 and 20411303410300.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 63176672 + ... + 63498932.
It is an arithmetic number, because the mean of its divisors is an integer number (1046982832272).
Almost surely, 220411303410322 is an apocalyptic number.
20411303410322 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20411303410322 is a deficient number, since it is larger than the sum of its proper divisors (13092147222382).
20411303410322 is a wasteful number, since it uses less digits than its factorization.
20411303410322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 331154.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 20411303410322 its reverse (22301430311402), we get a palindrome (42712733721724).
The spelling of 20411303410322 in words is "twenty trillion, four hundred eleven billion, three hundred three million, four hundred ten thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •