Base | Representation |
---|---|
bin | 101111000101000100… |
… | …1100110010110110110 |
3 | 100122221222021202112002 |
4 | 1132022021212112312 |
5 | 3124024104120042 |
6 | 114240131055302 |
7 | 10206254663603 |
oct | 1361211462666 |
9 | 318858252462 |
10 | 101102020022 |
11 | 39971500053 |
12 | 17716a41532 |
13 | 96c2c199b3 |
14 | 4c715676aa |
15 | 296ad6e132 |
hex | 178a2665b6 |
101102020022 has 4 divisors (see below), whose sum is σ = 151653030036. Its totient is φ = 50551010010.
The previous prime is 101102019947. The next prime is 101102020043. The reversal of 101102020022 is 220020201101.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 220020201101 = 17669 ⋅12452329.
It is a junction number, because it is equal to n+sod(n) for n = 101102019985 and 101102020012.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25275505004 + ... + 25275505007.
It is an arithmetic number, because the mean of its divisors is an integer number (37913257509).
Almost surely, 2101102020022 is an apocalyptic number.
101102020022 is a deficient number, since it is larger than the sum of its proper divisors (50551010014).
101102020022 is an equidigital number, since it uses as much as digits as its factorization.
101102020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50551010013.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 101102020022 its reverse (220020201101), we get a palindrome (321122221123).
The spelling of 101102020022 in words is "one hundred one billion, one hundred two million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •