Base | Representation |
---|---|
bin | 10111001100100101101001… |
… | …101111101110110010110010 |
3 | 111101020000210102122021201200 |
4 | 113030211221233232302302 |
5 | 101332444212332131002 |
6 | 1000551222440512030 |
7 | 30326465661323325 |
oct | 2714455157566262 |
9 | 441200712567650 |
10 | 102020132302002 |
11 | 2a56354a030482 |
12 | b538227a7b616 |
13 | 44c05c35c8445 |
14 | 1b29b2d3867bc |
15 | bbdb9ee4db1c |
hex | 5cc969beecb2 |
102020132302002 has 48 divisors (see below), whose sum is σ = 238094670647808. Its totient is φ = 31478862697920.
The previous prime is 102020132302001. The next prime is 102020132302013. The reversal of 102020132302002 is 200203231020201.
102020132302002 is a `hidden beast` number, since 10 + 20 + 201 + 3 + 230 + 200 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (102020132302001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3974591043 + ... + 3974616710.
It is an arithmetic number, because the mean of its divisors is an integer number (4960305638496).
Almost surely, 2102020132302002 is an apocalyptic number.
102020132302002 is an abundant number, since it is smaller than the sum of its proper divisors (136074538345806).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102020132302002 is a wasteful number, since it uses less digits than its factorization.
102020132302002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7949207815 (or 7949207812 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 102020132302002 its reverse (200203231020201), we get a palindrome (302223363322203).
The spelling of 102020132302002 in words is "one hundred two trillion, twenty billion, one hundred thirty-two million, three hundred two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •