Base | Representation |
---|---|
bin | 10111001111100001110111… |
… | …000111111000100100001001 |
3 | 111101221100102021200012010000 |
4 | 113033201313013320210021 |
5 | 101344302101332401301 |
6 | 1001224123433513213 |
7 | 30350211624162153 |
oct | 2717416707704411 |
9 | 441840367605100 |
10 | 102222220200201 |
11 | 2a631222414482 |
12 | b56b426872809 |
13 | 450668b35902a |
14 | 1b35820883ad3 |
15 | bc407b849786 |
hex | 5cf8771f8909 |
102222220200201 has 20 divisors (see below), whose sum is σ = 154214233200324. Its totient is φ = 67473412668000.
The previous prime is 102222220200077. The next prime is 102222220200271. The reversal of 102222220200201 is 102002022222201.
102222220200201 is a `hidden beast` number, since 1 + 0 + 2 + 222 + 220 + 20 + 0 + 201 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 60881190969600 + 41341029230601 = 7802640^2 + 6429699^2 .
It is not a de Polignac number, because 102222220200201 - 214 = 102222220183817 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102222220200271) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 6247530030 + ... + 6247546391.
Almost surely, 2102222220200201 is an apocalyptic number.
It is an amenable number.
102222220200201 is a deficient number, since it is larger than the sum of its proper divisors (51992013000123).
102222220200201 is a wasteful number, since it uses less digits than its factorization.
102222220200201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12495076534 (or 12495076525 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 102222220200201 its reverse (102002022222201), we get a palindrome (204224242422402).
The spelling of 102222220200201 in words is "one hundred two trillion, two hundred twenty-two billion, two hundred twenty million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.214 sec. • engine limits •