Base | Representation |
---|---|
bin | 111011101010101… |
… | …1010010001010100 |
3 | 12011112022021201012 |
4 | 1313111122101110 |
5 | 13100014220312 |
6 | 530355551352 |
7 | 100420403060 |
oct | 16725322124 |
9 | 5145267635 |
10 | 2002101332 |
11 | 938152400 |
12 | 47a5bb558 |
13 | 25ba3195a |
14 | 14dc84aa0 |
15 | bab7a322 |
hex | 7755a454 |
2002101332 has 72 divisors (see below), whose sum is σ = 4592853888. Its totient is φ = 746095680.
The previous prime is 2002101319. The next prime is 2002101379. The reversal of 2002101332 is 2331012002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 65078 + ... + 90770.
Almost surely, 22002101332 is an apocalyptic number.
2002101332 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2002101332, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2296426944).
2002101332 is an abundant number, since it is smaller than the sum of its proper divisors (2590752556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002101332 is a wasteful number, since it uses less digits than its factorization.
2002101332 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25749 (or 25736 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 2002101332 is about 44744.8469882287. The cubic root of 2002101332 is about 1260.3621475188.
Adding to 2002101332 its reverse (2331012002), we get a palindrome (4333113334).
The spelling of 2002101332 in words is "two billion, two million, one hundred one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •