Base | Representation |
---|---|
bin | 10111001111001101010001… |
… | …011000010000100011110101 |
3 | 111101212020100112102110100121 |
4 | 113033031101120100203311 |
5 | 101343421312200401401 |
6 | 1001210030001011541 |
7 | 30345500023465030 |
oct | 2717152130204365 |
9 | 441766315373317 |
10 | 102200112122101 |
11 | 2a622907a3a154 |
12 | b567096923bb1 |
13 | 4504576cc5706 |
14 | 1b3472460c017 |
15 | bc36d59bcca1 |
hex | 5cf3516108f5 |
102200112122101 has 16 divisors (see below), whose sum is σ = 119285667224064. Its totient is φ = 85735955228544.
The previous prime is 102200112122081. The next prime is 102200112122111. The reversal of 102200112122101 is 101221211002201.
It is a cyclic number.
It is not a de Polignac number, because 102200112122101 - 225 = 102200078567669 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102200112122111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 166454791 + ... + 167067643.
It is an arithmetic number, because the mean of its divisors is an integer number (7455354201504).
Almost surely, 2102200112122101 is an apocalyptic number.
It is an amenable number.
102200112122101 is a deficient number, since it is larger than the sum of its proper divisors (17085555101963).
102200112122101 is an equidigital number, since it uses as much as digits as its factorization.
102200112122101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1119780.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102200112122101 its reverse (101221211002201), we get a palindrome (203421323124302).
The spelling of 102200112122101 in words is "one hundred two trillion, two hundred billion, one hundred twelve million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •