Base | Representation |
---|---|
bin | 10111001111011000100001… |
… | …110111110111001010011001 |
3 | 111101220101112221220101112120 |
4 | 113033120201313313022121 |
5 | 101344121041200032301 |
6 | 1001215345250131453 |
7 | 30346405412665002 |
oct | 2717304167671231 |
9 | 441811487811476 |
10 | 102212200002201 |
11 | 2a627a50264403 |
12 | b5694aab80b89 |
13 | 45057524192a3 |
14 | 1b3514db841a9 |
15 | bc3b91cebe36 |
hex | 5cf621df7299 |
102212200002201 has 4 divisors (see below), whose sum is σ = 136282933336272. Its totient is φ = 68141466668132.
The previous prime is 102212200002167. The next prime is 102212200002229. The reversal of 102212200002201 is 102200002212201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102212200002201 - 29 = 102212200001689 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102212200002271) 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, 17035366667031 + ... + 17035366667036.
It is an arithmetic number, because the mean of its divisors is an integer number (34070733334068).
Almost surely, 2102212200002201 is an apocalyptic number.
It is an amenable number.
102212200002201 is a deficient number, since it is larger than the sum of its proper divisors (34070733334071).
102212200002201 is an equidigital number, since it uses as much as digits as its factorization.
102212200002201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34070733334070.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 102212200002201 its reverse (102200002212201), we get a palindrome (204412202214402).
The spelling of 102212200002201 in words is "one hundred two trillion, two hundred twelve billion, two hundred million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •