Base | Representation |
---|---|
bin | 11101011001010011110… |
… | …00100111011101010101 |
3 | 10120120001000212021202201 |
4 | 32230221320213131111 |
5 | 113022010111201401 |
6 | 2051555150204501 |
7 | 132654144351316 |
oct | 16545170473525 |
9 | 3516030767681 |
10 | 1010020022101 |
11 | 35a38aa758a2 |
12 | 1438b97b3731 |
13 | 743241764bc |
14 | 36c570dc60d |
15 | 1b41627bb01 |
hex | eb29e27755 |
1010020022101 has 4 divisors (see below), whose sum is σ = 1025094947872. Its totient is φ = 994945096332.
The previous prime is 1010020022071. The next prime is 1010020022119. The reversal of 1010020022101 is 1012200200101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1010020022101 - 225 = 1009986467669 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010020022171) by changing a digit.
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 in 3 ways as a sum of consecutive naturals, for example, 7537462785 + ... + 7537462918.
It is an arithmetic number, because the mean of its divisors is an integer number (256273736968).
Almost surely, 21010020022101 is an apocalyptic number.
It is an amenable number.
1010020022101 is a deficient number, since it is larger than the sum of its proper divisors (15074925771).
1010020022101 is an equidigital number, since it uses as much as digits as its factorization.
1010020022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15074925770.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1010020022101 its reverse (1012200200101), we get a palindrome (2022220222202).
The spelling of 1010020022101 in words is "one trillion, ten billion, twenty million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •