Base | Representation |
---|---|
bin | 10111001100010011111011… |
… | …010110000001100001010110 |
3 | 111101011012200001101022221202 |
4 | 113030103323112001201112 |
5 | 101332141223122400042 |
6 | 1000534354124512502 |
7 | 30325223231165462 |
oct | 2714237326014126 |
9 | 441135601338852 |
10 | 102001100200022 |
11 | 2a556472999581 |
12 | b5345b60ab732 |
13 | 44bb87c5cb03a |
14 | 1b28c458534a2 |
15 | bbd439172632 |
hex | 5cc4fb581856 |
102001100200022 has 4 divisors (see below), whose sum is σ = 153001650300036. Its totient is φ = 51000550100010.
The previous prime is 102001100200007. The next prime is 102001100200049. The reversal of 102001100200022 is 220002001100201.
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 = 102001100199976 and 102001100200012.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 25500275050004 + ... + 25500275050007.
It is an arithmetic number, because the mean of its divisors is an integer number (38250412575009).
Almost surely, 2102001100200022 is an apocalyptic number.
102001100200022 is a deficient number, since it is larger than the sum of its proper divisors (51000550100014).
102001100200022 is an equidigital number, since it uses as much as digits as its factorization.
102001100200022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51000550100013.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 102001100200022 its reverse (220002001100201), we get a palindrome (322003101300223).
The spelling of 102001100200022 in words is "one hundred two trillion, one billion, one hundred million, two hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •