Base | Representation |
---|---|
bin | 10111001101111001100010… |
… | …010100101111100111111110 |
3 | 111101112122021112212010000021 |
4 | 113031321202110233213332 |
5 | 101340433143214201342 |
6 | 1001100440153122354 |
7 | 30336134666063251 |
oct | 2715714224574776 |
9 | 441478245763007 |
10 | 102110202100222 |
11 | 2a59876a094a48 |
12 | b5517840b93ba |
13 | 44c8c48a18434 |
14 | 1b30235653098 |
15 | bc11c24b6567 |
hex | 5cde6252f9fe |
102110202100222 has 4 divisors (see below), whose sum is σ = 153165303150336. Its totient is φ = 51055101050110.
The previous prime is 102110202100219. The next prime is 102110202100223. The reversal of 102110202100222 is 222001202011201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 102110202100196 and 102110202100205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102110202100223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25527550525054 + ... + 25527550525057.
It is an arithmetic number, because the mean of its divisors is an integer number (38291325787584).
Almost surely, 2102110202100222 is an apocalyptic number.
102110202100222 is a deficient number, since it is larger than the sum of its proper divisors (51055101050114).
102110202100222 is an equidigital number, since it uses as much as digits as its factorization.
102110202100222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51055101050113.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 102110202100222 its reverse (222001202011201), we get a palindrome (324111404111423).
The spelling of 102110202100222 in words is "one hundred two trillion, one hundred ten billion, two hundred two million, one hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •