Base | Representation |
---|---|
bin | 10110111101111010110000… |
… | …111110110011001101010110 |
3 | 111020122122122122220021011211 |
4 | 112331322300332303031112 |
5 | 101214440044042320042 |
6 | 554500135443452034 |
7 | 30163606530214411 |
oct | 2675726076631526 |
9 | 436578578807154 |
10 | 101012010120022 |
11 | 2a204a53375aa1 |
12 | b3b497998701a |
13 | 44495126aa681 |
14 | 1ad301634cb78 |
15 | ba284a605017 |
hex | 5bdeb0fb3356 |
101012010120022 has 4 divisors (see below), whose sum is σ = 151518015180036. Its totient is φ = 50506005060010.
The previous prime is 101012010119987. The next prime is 101012010120031. The reversal of 101012010120022 is 220021010210101.
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 = 101012010119984 and 101012010120011.
It is a congruent number.
It is an unprimeable number.
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, 25253002530004 + ... + 25253002530007.
It is an arithmetic number, because the mean of its divisors is an integer number (37879503795009).
Almost surely, 2101012010120022 is an apocalyptic number.
101012010120022 is a deficient number, since it is larger than the sum of its proper divisors (50506005060014).
101012010120022 is an equidigital number, since it uses as much as digits as its factorization.
101012010120022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50506005060013.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101012010120022 its reverse (220021010210101), we get a palindrome (321033020330123).
The spelling of 101012010120022 in words is "one hundred one trillion, twelve billion, ten million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •