Base | Representation |
---|---|
bin | 10111001101110010000000… |
… | …000000101000100010100011 |
3 | 111101111212101121112111201020 |
4 | 113031302000000220202203 |
5 | 101340320110203211321 |
6 | 1001053021211540523 |
7 | 30335430321126216 |
oct | 2715620000504243 |
9 | 441455347474636 |
10 | 102102110210211 |
11 | 2a595297465241 |
12 | b5500a615a743 |
13 | 44c8259441037 |
14 | 1b2daa8aa977d |
15 | bc0d9bdb94c6 |
hex | 5cdc800288a3 |
102102110210211 has 8 divisors (see below), whose sum is σ = 136515356271360. Its totient is φ = 67878468811272.
The previous prime is 102102110210153. The next prime is 102102110210251. The reversal of 102102110210211 is 112012011201201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102102110210211 - 26 = 102102110210147 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102102110210251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47401164295 + ... + 47401166448.
It is an arithmetic number, because the mean of its divisors is an integer number (17064419533920).
Almost surely, 2102102110210211 is an apocalyptic number.
102102110210211 is a deficient number, since it is larger than the sum of its proper divisors (34413246061149).
102102110210211 is an equidigital number, since it uses as much as digits as its factorization.
102102110210211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94802331105.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 102102110210211 its reverse (112012011201201), we get a palindrome (214114121411412).
The spelling of 102102110210211 in words is "one hundred two trillion, one hundred two billion, one hundred ten million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •