Base | Representation |
---|---|
bin | 10111001111010110011111… |
… | …011010001111110111111101 |
3 | 111101220011220102021202210012 |
4 | 113033112133122033313331 |
5 | 101344102100331413041 |
6 | 1001214344140353005 |
7 | 30346300234330313 |
oct | 2717263732176775 |
9 | 441804812252705 |
10 | 102210011201021 |
11 | 2a627027793709 |
12 | b568b99b45765 |
13 | 4505493b09069 |
14 | 1b34dc31c00b3 |
15 | bc3ab4a933eb |
hex | 5cf59f68fdfd |
102210011201021 has 16 divisors (see below), whose sum is σ = 103387711305600. Its totient is φ = 101035685352000.
The previous prime is 102210011201009. The next prime is 102210011201059. The reversal of 102210011201021 is 120102110012201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102210011201021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102210011200987 and 102210011201005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102210011201621) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 164112035 + ... + 164733663.
It is an arithmetic number, because the mean of its divisors is an integer number (6461731956600).
Almost surely, 2102210011201021 is an apocalyptic number.
It is an amenable number.
102210011201021 is a deficient number, since it is larger than the sum of its proper divisors (1177700104579).
102210011201021 is a wasteful number, since it uses less digits than its factorization.
102210011201021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 624340.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 102210011201021 its reverse (120102110012201), we get a palindrome (222312121213222).
The spelling of 102210011201021 in words is "one hundred two trillion, two hundred ten billion, eleven million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •