Base | Representation |
---|---|
bin | 11101000111101100000… |
… | …011110000111000111110 |
3 | 21002022020111201000122020 |
4 | 131013230003300320332 |
5 | 230241243232433202 |
6 | 4131145114501010 |
7 | 264401424032004 |
oct | 35075403607076 |
9 | 7068214630566 |
10 | 2001120202302 |
11 | 701741204411 |
12 | 2839b7134766 |
13 | 116921669580 |
14 | 6cbd756aa74 |
15 | 370c15045bc |
hex | 1d1ec0f0e3e |
2001120202302 has 128 divisors (see below), whose sum is σ = 4429280378880. Its totient is φ = 598981426560.
The previous prime is 2001120202253. The next prime is 2001120202313. The reversal of 2001120202302 is 2032020211002.
It is a happy number.
It is a super-2 number, since 2×20011202023022 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 138737863 + ... + 138752285.
It is an arithmetic number, because the mean of its divisors is an integer number (34603752960).
Almost surely, 22001120202302 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2001120202302, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2214640189440).
2001120202302 is an abundant number, since it is smaller than the sum of its proper divisors (2428160176578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2001120202302 is a wasteful number, since it uses less digits than its factorization.
2001120202302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14838.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 2001120202302 its reverse (2032020211002), we get a palindrome (4033140413304).
The spelling of 2001120202302 in words is "two trillion, one billion, one hundred twenty million, two hundred two thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •