Base | Representation |
---|---|
bin | 101111100110001001… |
… | …1111010011111110010 |
3 | 100202211022221121112011 |
4 | 1133030103322133302 |
5 | 3133312234121320 |
6 | 114542222153134 |
7 | 10245623560006 |
oct | 1371423723762 |
9 | 322738847464 |
10 | 102212020210 |
11 | 3a391025683 |
12 | 179867227aa |
13 | 983bb8c341 |
14 | 4d38b4a706 |
15 | 29d352d05a |
hex | 17cc4fa7f2 |
102212020210 has 8 divisors (see below), whose sum is σ = 183981636396. Its totient is φ = 40884808080.
The previous prime is 102212020193. The next prime is 102212020213. The reversal of 102212020210 is 12020212201.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 99218070121 + 2993950089 = 314989^2 + 54717^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-4 number, since 4×1022120202104 (a number of 45 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (102212020213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5110601001 + ... + 5110601020.
Almost surely, 2102212020210 is an apocalyptic number.
102212020210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102212020210 is a deficient number, since it is larger than the sum of its proper divisors (81769616186).
102212020210 is a wasteful number, since it uses less digits than its factorization.
102212020210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10221202028.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 102212020210 its reverse (12020212201), we get a palindrome (114232232411).
The spelling of 102212020210 in words is "one hundred two billion, two hundred twelve million, twenty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •