Base | Representation |
---|---|
bin | 1001001011111001011110… |
… | …0000111100110010101001 |
3 | 1022202112220001220020120000 |
4 | 2102332113200330302221 |
5 | 2310434310042010441 |
6 | 33251514112453213 |
7 | 2061462444301341 |
oct | 222762740746251 |
9 | 38675801806500 |
10 | 10100010110121 |
11 | 3244432444a98 |
12 | 1171548b4a209 |
13 | 583571a97989 |
14 | 26cbb3661d21 |
15 | 127aceec82b6 |
hex | 92f9783cca9 |
10100010110121 has 20 divisors (see below), whose sum is σ = 15094414294212. Its totient is φ = 6730329966048.
The previous prime is 10100010110117. The next prime is 10100010110143. The reversal of 10100010110121 is 12101101000101.
It can be written as a sum of positive squares in 2 ways, for example, as 9395518474521 + 704491635600 = 3065211^2 + 839340^2 .
It is not a de Polignac number, because 10100010110121 - 22 = 10100010110117 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (10100010110111) 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 19 ways as a sum of consecutive naturals, for example, 27689050 + ... + 28051443.
Almost surely, 210100010110121 is an apocalyptic number.
It is an amenable number.
10100010110121 is a deficient number, since it is larger than the sum of its proper divisors (4994404184091).
10100010110121 is an equidigital number, since it uses as much as digits as its factorization.
10100010110121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55742742 (or 55742733 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10100010110121 its reverse (12101101000101), we get a palindrome (22201111110222).
The spelling of 10100010110121 in words is "ten trillion, one hundred billion, ten million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •