Base | Representation |
---|---|
bin | 10011000000000000… |
… | …011110101011100010 |
3 | 1221122210111101001200 |
4 | 103000000132223202 |
5 | 313240203022242 |
6 | 13212220542030 |
7 | 1321363340310 |
oct | 230000365342 |
9 | 57583441050 |
10 | 20401220322 |
11 | 8719a5886a |
12 | 3b543b1916 |
13 | 1c01855802 |
14 | db76c70b0 |
15 | 7e60c104c |
hex | 4c001eae2 |
20401220322 has 48 divisors (see below), whose sum is σ = 53176119360. Its totient is φ = 5522134176.
The previous prime is 20401220309. The next prime is 20401220327. The reversal of 20401220322 is 22302210402.
20401220322 is a `hidden beast` number, since 20 + 401 + 220 + 3 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 20401220295 and 20401220304.
It is not an unprimeable number, because it can be changed into a prime (20401220327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4258513 + ... + 4263300.
It is an arithmetic number, because the mean of its divisors is an integer number (1107835820).
Almost surely, 220401220322 is an apocalyptic number.
20401220322 is an abundant number, since it is smaller than the sum of its proper divisors (32774899038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20401220322 is a wasteful number, since it uses less digits than its factorization.
20401220322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8521847 (or 8521844 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 18.
Adding to 20401220322 its reverse (22302210402), we get a palindrome (42703430724).
The spelling of 20401220322 in words is "twenty billion, four hundred one million, two hundred twenty thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •