Base | Representation |
---|---|
bin | 10110111111010110000001… |
… | …101000111100101000101001 |
3 | 111021000000120202100112012101 |
4 | 112333112001220330220221 |
5 | 101223041240012010441 |
6 | 555013143125213401 |
7 | 30203646026330632 |
oct | 2677260150745051 |
9 | 437000522315171 |
10 | 101110000110121 |
11 | 2a242568147992 |
12 | b40b966561261 |
13 | 445582a949832 |
14 | 1ad7a7046a889 |
15 | ba5183151231 |
hex | 5bf581a3ca29 |
101110000110121 has 2 divisors, whose sum is σ = 101110000110122. Its totient is φ = 101110000110120.
The previous prime is 101110000110073. The next prime is 101110000110127. The reversal of 101110000110121 is 121011000011101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88827533626896 + 12282466483225 = 9424836^2 + 3504635^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101110000110121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101110000110098 and 101110000110107.
It is not a weakly prime, because it can be changed into another prime (101110000110127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50555000055060 + 50555000055061.
It is an arithmetic number, because the mean of its divisors is an integer number (50555000055061).
Almost surely, 2101110000110121 is an apocalyptic number.
It is an amenable number.
101110000110121 is a deficient number, since it is larger than the sum of its proper divisors (1).
101110000110121 is an equidigital number, since it uses as much as digits as its factorization.
101110000110121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 101110000110121 its reverse (121011000011101), we get a palindrome (222121000121222).
The spelling of 101110000110121 in words is "one hundred one trillion, one hundred ten billion, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •