Base | Representation |
---|---|
bin | 10000001011110110001… |
… | …010001110111100011001 |
3 | 10221022212022200022021201 |
4 | 100023312022032330121 |
5 | 121210322222041103 |
6 | 2210541351434201 |
7 | 143233063152631 |
oct | 20136612167431 |
9 | 3838768608251 |
10 | 1112231440153 |
11 | 39977071a019 |
12 | 15b684085961 |
13 | 80b62b84722 |
14 | 3bb91b2d6c1 |
15 | 1dde96db51d |
hex | 102f628ef19 |
1112231440153 has 2 divisors, whose sum is σ = 1112231440154. Its totient is φ = 1112231440152.
The previous prime is 1112231440109. The next prime is 1112231440181. The reversal of 1112231440153 is 3510441322111.
It is an a-pointer prime, because the next prime (1112231440181) can be obtained adding 1112231440153 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 779542428889 + 332689011264 = 882917^2 + 576792^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1112231440153 is a prime.
It is not a weakly prime, because it can be changed into another prime (1112231440553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556115720076 + 556115720077.
It is an arithmetic number, because the mean of its divisors is an integer number (556115720077).
Almost surely, 21112231440153 is an apocalyptic number.
It is an amenable number.
1112231440153 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112231440153 is an equidigital number, since it uses as much as digits as its factorization.
1112231440153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 1112231440153 its reverse (3510441322111), we get a palindrome (4622672762264).
The spelling of 1112231440153 in words is "one trillion, one hundred twelve billion, two hundred thirty-one million, four hundred forty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.207 sec. • engine limits •