Base | Representation |
---|---|
bin | 110100001000010011… |
… | …1101110101100110101 |
3 | 101200221211220122002012 |
4 | 1220100213232230311 |
5 | 3313232142000203 |
6 | 123232254054005 |
7 | 11042114204621 |
oct | 1502047565465 |
9 | 350854818065 |
10 | 111948000053 |
11 | 4352780040a |
12 | 198431aa305 |
13 | a730c68766 |
14 | 55bdbc4181 |
15 | 2da3137bd8 |
hex | 1a109eeb35 |
111948000053 has 2 divisors, whose sum is σ = 111948000054. Its totient is φ = 111948000052.
The previous prime is 111948000049. The next prime is 111948000083. The reversal of 111948000053 is 350000849111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95208039364 + 16739960689 = 308558^2 + 129383^2 .
It is a cyclic number.
It is not a de Polignac number, because 111948000053 - 22 = 111948000049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111947999983 and 111948000019.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111948000083) 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 as a sum of consecutive naturals, namely, 55974000026 + 55974000027.
It is an arithmetic number, because the mean of its divisors is an integer number (55974000027).
Almost surely, 2111948000053 is an apocalyptic number.
It is an amenable number.
111948000053 is a deficient number, since it is larger than the sum of its proper divisors (1).
111948000053 is an equidigital number, since it uses as much as digits as its factorization.
111948000053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 32.
Adding to 111948000053 its reverse (350000849111), we get a palindrome (461948849164).
The spelling of 111948000053 in words is "one hundred eleven billion, nine hundred forty-eight million, fifty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •