Base | Representation |
---|---|
bin | 110011101100010111… |
… | …0000011000000100001 |
3 | 101121112111010222222102 |
4 | 1213120232003000201 |
5 | 3304322043211001 |
6 | 122555232220145 |
7 | 11006635360466 |
oct | 1473056030041 |
9 | 347474128872 |
10 | 111010132001 |
11 | 4309636424a |
12 | 1962109a655 |
13 | a611873a52 |
14 | 553140b66d |
15 | 2d4ab2ae6b |
hex | 19d8b83021 |
111010132001 has 2 divisors, whose sum is σ = 111010132002. Its totient is φ = 111010132000.
The previous prime is 111010131949. The next prime is 111010132033. The reversal of 111010132001 is 100231010111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 55762099600 + 55248032401 = 236140^2 + 235049^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111010132001 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (111010132061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55505066000 + 55505066001.
It is an arithmetic number, because the mean of its divisors is an integer number (55505066001).
Almost surely, 2111010132001 is an apocalyptic number.
It is an amenable number.
111010132001 is a deficient number, since it is larger than the sum of its proper divisors (1).
111010132001 is an equidigital number, since it uses as much as digits as its factorization.
111010132001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 111010132001 its reverse (100231010111), we get a palindrome (211241142112).
The spelling of 111010132001 in words is "one hundred eleven billion, ten million, one hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •