Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …001101111010110001101001 |
3 | 111010102122202120101210120002 |
4 | 112300223100031322301221 |
5 | 101110032344241010441 |
6 | 552522120252312345 |
7 | 30041062622235113 |
oct | 2660532015726151 |
9 | 433378676353502 |
10 | 100102001110121 |
11 | 29994024a7799a |
12 | b2885317726b5 |
13 | 43b17693cb0ca |
14 | 1aa0d6993a3b3 |
15 | b88d3953ab9b |
hex | 5b0ad037ac69 |
100102001110121 has 2 divisors, whose sum is σ = 100102001110122. Its totient is φ = 100102001110120.
The previous prime is 100102001110073. The next prime is 100102001110129. The reversal of 100102001110121 is 121011100201001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 58225506958096 + 41876494152025 = 7630564^2 + 6471205^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100102001110121 is a prime.
It is not a weakly prime, because it can be changed into another prime (100102001110129) 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 as a sum of consecutive naturals, namely, 50051000555060 + 50051000555061.
It is an arithmetic number, because the mean of its divisors is an integer number (50051000555061).
Almost surely, 2100102001110121 is an apocalyptic number.
It is an amenable number.
100102001110121 is a deficient number, since it is larger than the sum of its proper divisors (1).
100102001110121 is an equidigital number, since it uses as much as digits as its factorization.
100102001110121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100102001110121 its reverse (121011100201001), we get a palindrome (221113101311122).
The spelling of 100102001110121 in words is "one hundred trillion, one hundred two billion, one million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •