Base | Representation |
---|---|
bin | 110011101100101011… |
… | …1101000001010100101 |
3 | 101121120020122210002211 |
4 | 1213121113220022211 |
5 | 3304332341011401 |
6 | 123000302003421 |
7 | 11010130126300 |
oct | 1473127501245 |
9 | 347506583084 |
10 | 111021032101 |
11 | 430a15296a1 |
12 | 19624876571 |
13 | a613bbc205 |
14 | 5532a47b37 |
15 | 2d4ba80951 |
hex | 19d95e82a5 |
111021032101 has 12 divisors (see below), whose sum is σ = 129158007948. Its totient is φ = 95152710912.
The previous prime is 111021032077. The next prime is 111021032113. The reversal of 111021032101 is 101230120111.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 53312501025 + 57708531076 = 230895^2 + 240226^2 .
It is not a de Polignac number, because 111021032101 - 27 = 111021031973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111021032141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 518325 + ... + 700501.
It is an arithmetic number, because the mean of its divisors is an integer number (10763167329).
Almost surely, 2111021032101 is an apocalyptic number.
It is an amenable number.
111021032101 is a deficient number, since it is larger than the sum of its proper divisors (18136975847).
111021032101 is a wasteful number, since it uses less digits than its factorization.
111021032101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194628 (or 194621 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 111021032101 its reverse (101230120111), we get a palindrome (212251152212).
The spelling of 111021032101 in words is "one hundred eleven billion, twenty-one million, thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •