Base | Representation |
---|---|
bin | 10111001101110010000101… |
… | …010111100101010001001001 |
3 | 111101111212121212201000001120 |
4 | 113031302011113211101021 |
5 | 101340320301212042301 |
6 | 1001053034142505453 |
7 | 30335432462233152 |
oct | 2715620527452111 |
9 | 441455555630046 |
10 | 102102200112201 |
11 | 2a595333189a03 |
12 | b550110295289 |
13 | 44c8271c5a493 |
14 | 1b2dab69cc929 |
15 | bc0da4c26e36 |
hex | 5cdc855e5449 |
102102200112201 has 8 divisors (see below), whose sum is σ = 136378071910560. Its totient is φ = 67947230860992.
The previous prime is 102102200112191. The next prime is 102102200112203. The reversal of 102102200112201 is 102211002201201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102102200112201 - 227 = 102102065894473 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102102200112203) 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 7 ways as a sum of consecutive naturals, for example, 30225634816 + ... + 30225638193.
It is an arithmetic number, because the mean of its divisors is an integer number (17047258988820).
Almost surely, 2102102200112201 is an apocalyptic number.
It is an amenable number.
102102200112201 is a deficient number, since it is larger than the sum of its proper divisors (34275871798359).
102102200112201 is an equidigital number, since it uses as much as digits as its factorization.
102102200112201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60451273575.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102102200112201 its reverse (102211002201201), we get a palindrome (204313202313402).
The spelling of 102102200112201 in words is "one hundred two trillion, one hundred two billion, two hundred million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •