Base | Representation |
---|---|
bin | 10110111111001100110100… |
… | …010001001100001001110001 |
3 | 111020222002001122022200001102 |
4 | 112333030310101030021301 |
5 | 101222411012144231001 |
6 | 555004430023014145 |
7 | 30203146011544625 |
oct | 2677146421141161 |
9 | 436862048280042 |
10 | 101100112102001 |
11 | 2a239353675051 |
12 | b409a66b9a355 |
13 | 445491321125c |
14 | 1ad73b313b185 |
15 | ba4ca5015e6b |
hex | 5bf33444c271 |
101100112102001 has 2 divisors, whose sum is σ = 101100112102002. Its totient is φ = 101100112102000.
The previous prime is 101100112101899. The next prime is 101100112102007. The reversal of 101100112102001 is 100201211001101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 63247409574976 + 37852702527025 = 7952824^2 + 6152455^2 .
It is a cyclic number.
It is not a de Polignac number, because 101100112102001 - 226 = 101100044993137 is a prime.
It is not a weakly prime, because it can be changed into another prime (101100112102007) 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, 50550056051000 + 50550056051001.
It is an arithmetic number, because the mean of its divisors is an integer number (50550056051001).
Almost surely, 2101100112102001 is an apocalyptic number.
It is an amenable number.
101100112102001 is a deficient number, since it is larger than the sum of its proper divisors (1).
101100112102001 is an equidigital number, since it uses as much as digits as its factorization.
101100112102001 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 101100112102001 its reverse (100201211001101), we get a palindrome (201301323103102).
The spelling of 101100112102001 in words is "one hundred one trillion, one hundred billion, one hundred twelve million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •