Base | Representation |
---|---|
bin | 101111100000001100… |
… | …1101010010001010110 |
3 | 100202022101221200202110 |
4 | 1133000121222101112 |
5 | 3132410110400042 |
6 | 114510323251450 |
7 | 10240646251605 |
oct | 1370031522126 |
9 | 322271850673 |
10 | 102012200022 |
11 | 3a299255827 |
12 | 1792b819b86 |
13 | 9809668b45 |
14 | 4d1a3b3a3c |
15 | 29c0c0c09c |
hex | 17c066a456 |
102012200022 has 8 divisors (see below), whose sum is σ = 204024400056. Its totient is φ = 34004066672.
The previous prime is 102012200011. The next prime is 102012200057. The reversal of 102012200022 is 220002210201.
It is a sphenic number, since it is the product of 3 distinct primes.
102012200022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 102012199980 and 102012200007.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 8501016663 + ... + 8501016674.
It is an arithmetic number, because the mean of its divisors is an integer number (25503050007).
Almost surely, 2102012200022 is an apocalyptic number.
102012200022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102012200022 is a wasteful number, since it uses less digits than its factorization.
102012200022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17002033342.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 102012200022 its reverse (220002210201), we get a palindrome (322014410223).
It can be divided in two parts, 10201 and 2200022, that multiplied together give a palindrome (22442424422).
The spelling of 102012200022 in words is "one hundred two billion, twelve million, two hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •