Base | Representation |
---|---|
bin | 101110100101010001110… |
… | …000001100001110101100 |
3 | 102100000122201012210112002 |
4 | 232211101300030032230 |
5 | 404421344242114040 |
6 | 10450324130431432 |
7 | 450162535642241 |
oct | 56452160141654 |
9 | 12300581183462 |
10 | 3201122223020 |
11 | 1024652050717 |
12 | 438495432578 |
13 | 1a2b314b0c67 |
14 | b0d1405d5c8 |
15 | 5840648da15 |
hex | 2e951c0c3ac |
3201122223020 has 24 divisors (see below), whose sum is σ = 6741618450000. Its totient is φ = 1276779978432.
The previous prime is 3201122223011. The next prime is 3201122223077. The reversal of 3201122223020 is 203222211023.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 3201122222983 and 3201122223001.
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 7 ways as a sum of consecutive naturals, for example, 229299770 + ... + 229313729.
It is an arithmetic number, because the mean of its divisors is an integer number (280900768750).
Almost surely, 23201122223020 is an apocalyptic number.
It is an amenable number.
3201122223020 is an abundant number, since it is smaller than the sum of its proper divisors (3540496226980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3201122223020 is a wasteful number, since it uses less digits than its factorization.
3201122223020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458613857 (or 458613855 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 3201122223020 its reverse (203222211023), we get a palindrome (3404344434043).
The spelling of 3201122223020 in words is "three trillion, two hundred one billion, one hundred twenty-two million, two hundred twenty-three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •