Base | Representation |
---|---|
bin | 10111001100011110010000… |
… | …111100011100000111101101 |
3 | 111101012021022121122010001012 |
4 | 113030132100330130013231 |
5 | 101332331441200311341 |
6 | 1000543431400155005 |
7 | 30326065262053244 |
oct | 2714362074340755 |
9 | 441167277563035 |
10 | 102012200010221 |
11 | 2a5601494a9236 |
12 | b536793468a65 |
13 | 44bc92b100977 |
14 | 1b295b9aa595b |
15 | bbd88887a0eb |
hex | 5cc790f1c1ed |
102012200010221 has 24 divisors (see below), whose sum is σ = 104476434042240. Its totient is φ = 99560898412800.
The previous prime is 102012200010199. The next prime is 102012200010247. The reversal of 102012200010221 is 122010002210201.
It is not a de Polignac number, because 102012200010221 - 234 = 101995020141037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102012200010196 and 102012200010205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102012200018221) 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, 17298996545 + ... + 17299002441.
It is an arithmetic number, because the mean of its divisors is an integer number (4353184751760).
Almost surely, 2102012200010221 is an apocalyptic number.
It is an amenable number.
102012200010221 is a deficient number, since it is larger than the sum of its proper divisors (2464234032019).
102012200010221 is an frugal number, since it uses more digits than its factorization.
102012200010221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8165 (or 7564 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 102012200010221 its reverse (122010002210201), we get a palindrome (224022202220422).
The spelling of 102012200010221 in words is "one hundred two trillion, twelve billion, two hundred million, ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •