Base | Representation |
---|---|
bin | 1011111011001101… |
… | …0001000000000100 |
3 | 22021002110020102101 |
4 | 2332303101000010 |
5 | 23023441010040 |
6 | 1245350521444 |
7 | 142216662163 |
oct | 27663210004 |
9 | 8232406371 |
10 | 3201110020 |
11 | 13a2a41379 |
12 | 754066284 |
13 | 3c0269b54 |
14 | 2251d73da |
15 | 13b06c09a |
hex | becd1004 |
3201110020 has 48 divisors (see below), whose sum is σ = 6842304000. Its totient is φ = 1257759360.
The previous prime is 3201110009. The next prime is 3201110021. The reversal of 3201110020 is 200111023.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 3201109979 and 3201110006.
It is not an unprimeable number, because it can be changed into a prime (3201110021) 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 15 ways as a sum of consecutive naturals, for example, 309330 + ... + 319510.
It is an arithmetic number, because the mean of its divisors is an integer number (142548000).
Almost surely, 23201110020 is an apocalyptic number.
It is an amenable number.
3201110020 is an abundant number, since it is smaller than the sum of its proper divisors (3641193980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3201110020 is a wasteful number, since it uses less digits than its factorization.
3201110020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10468 (or 10466 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 3201110020 is about 56578.3529275994. The cubic root of 3201110020 is about 1473.7829692851.
Adding to 3201110020 its reverse (200111023), we get a palindrome (3401221043).
The spelling of 3201110020 in words is "three billion, two hundred one million, one hundred ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.065 sec. • engine limits •