Base | Representation |
---|---|
bin | 11101100100011100110… |
… | …000100001000001010100 |
3 | 21012020221201021110102220 |
4 | 131210130300201001110 |
5 | 231243020003324340 |
6 | 4153253331102340 |
7 | 266543622053226 |
oct | 35443460410124 |
9 | 7166851243386 |
10 | 2032002011220 |
11 | 713849185545 |
12 | 2899954419b0 |
13 | 11980362909c |
14 | 704c6b58416 |
15 | 37ccc764ed0 |
hex | 1d91cc21054 |
2032002011220 has 48 divisors (see below), whose sum is σ = 5692889018880. Its totient is φ = 541554499456.
The previous prime is 2032002011189. The next prime is 2032002011231. The reversal of 2032002011220 is 221102002302.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2032002011220.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9667140 + ... + 9875099.
It is an arithmetic number, because the mean of its divisors is an integer number (118601854560).
Almost surely, 22032002011220 is an apocalyptic number.
2032002011220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2032002011220 is an abundant number, since it is smaller than the sum of its proper divisors (3660887007660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2032002011220 is a wasteful number, since it uses less digits than its factorization.
2032002011220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19543984 (or 19543982 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 2032002011220 its reverse (221102002302), we get a palindrome (2253104013522).
The spelling of 2032002011220 in words is "two trillion, thirty-two billion, two million, eleven thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •