Base | Representation |
---|---|
bin | 10111001101110000000011… |
… | …011011100010001110000010 |
3 | 111101111122222221122102112002 |
4 | 113031300003123202032002 |
5 | 101340301320122011320 |
6 | 1001052033545504002 |
7 | 30335324451434213 |
oct | 2715600333421602 |
9 | 441448887572462 |
10 | 102100020110210 |
11 | 2a594414679171 |
12 | b54b8021a2002 |
13 | 44c7cb540b385 |
14 | 1b2d94b27940a |
15 | bc0cc865a675 |
hex | 5cdc036e2382 |
102100020110210 has 8 divisors (see below), whose sum is σ = 183780036198396. Its totient is φ = 40840008044080.
The previous prime is 102100020110161. The next prime is 102100020110213. The reversal of 102100020110210 is 12011020001201.
It can be written as a sum of positive squares in 2 ways, for example, as 99268921097641 + 2831099012569 = 9963379^2 + 1682587^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 102100020110191 and 102100020110200.
It is not an unprimeable number, because it can be changed into a prime (102100020110213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5105001005501 + ... + 5105001005520.
Almost surely, 2102100020110210 is an apocalyptic number.
102100020110210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102100020110210 is a deficient number, since it is larger than the sum of its proper divisors (81680016088186).
102100020110210 is a wasteful number, since it uses less digits than its factorization.
102100020110210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10210002011028.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102100020110210 its reverse (12011020001201), we get a palindrome (114111040111411).
The spelling of 102100020110210 in words is "one hundred two trillion, one hundred billion, twenty million, one hundred ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •