Base | Representation |
---|---|
bin | 10000001001111000010… |
… | …111100101100000110101 |
3 | 10221010102020112102002101 |
4 | 100021320113211200311 |
5 | 121142011434330003 |
6 | 2205552121542101 |
7 | 143126555621662 |
oct | 20117027454065 |
9 | 3833366472071 |
10 | 1110121011253 |
11 | 398888408601 |
12 | 15b195344931 |
13 | 808b7884a27 |
14 | 3ba3172aa69 |
15 | 1dd242b411d |
hex | 102785e5835 |
1110121011253 has 2 divisors, whose sum is σ = 1110121011254. Its totient is φ = 1110121011252.
The previous prime is 1110121011211. The next prime is 1110121011257. The reversal of 1110121011253 is 3521101210111.
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., 852080378724 + 258040632529 = 923082^2 + 507977^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110121011253 - 29 = 1110121010741 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1110121011253.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110121011257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555060505626 + 555060505627.
It is an arithmetic number, because the mean of its divisors is an integer number (555060505627).
Almost surely, 21110121011253 is an apocalyptic number.
It is an amenable number.
1110121011253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110121011253 is an equidigital number, since it uses as much as digits as its factorization.
1110121011253 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60, while the sum is 19.
Adding to 1110121011253 its reverse (3521101210111), we get a palindrome (4631222221364).
The spelling of 1110121011253 in words is "one trillion, one hundred ten billion, one hundred twenty-one million, eleven thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •