Base | Representation |
---|---|
bin | 10111001110000100100010… |
… | …101111001101111100001001 |
3 | 111101120202210011200210102220 |
4 | 113032010202233031330021 |
5 | 101341131344132401301 |
6 | 1001110113004044253 |
7 | 30340033601216241 |
oct | 2716044257157411 |
9 | 441522704623386 |
10 | 102122020200201 |
11 | 2a5a27840a6421 |
12 | b553b21b33689 |
13 | 44ca0b02922c1 |
14 | 1b30a37040b21 |
15 | bc1664ca5936 |
hex | 5ce122bcdf09 |
102122020200201 has 8 divisors (see below), whose sum is σ = 136171655860320. Its totient is φ = 68076865670112.
The previous prime is 102122020200191. The next prime is 102122020200223. The reversal of 102122020200201 is 102002020221201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102122020200201 - 235 = 102087660461833 is a prime.
It is a super-2 number, since 2×1021220202002012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102122020200281) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1120229331 + ... + 1120320488.
It is an arithmetic number, because the mean of its divisors is an integer number (17021456982540).
Almost surely, 2102122020200201 is an apocalyptic number.
It is an amenable number.
102122020200201 is a deficient number, since it is larger than the sum of its proper divisors (34049635660119).
102122020200201 is a wasteful number, since it uses less digits than its factorization.
102122020200201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2240565015.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 102122020200201 its reverse (102002020221201), we get a palindrome (204124040421402).
The spelling of 102122020200201 in words is "one hundred two trillion, one hundred twenty-two billion, twenty million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •