Base | Representation |
---|---|
bin | 10010001111011100001… |
… | …111001001011011100001 |
3 | 11102211120200200021210201 |
4 | 102033130033021123201 |
5 | 131014212243111231 |
6 | 2355510335425201 |
7 | 156364436642665 |
oct | 22173417113341 |
9 | 4384520607721 |
10 | 1253530441441 |
11 | 44368a289043 |
12 | 182b38985201 |
13 | 912908c1c25 |
14 | 44957a9c8a5 |
15 | 229194a2161 |
hex | 123dc3c96e1 |
1253530441441 has 2 divisors, whose sum is σ = 1253530441442. Its totient is φ = 1253530441440.
The previous prime is 1253530441337. The next prime is 1253530441451. The reversal of 1253530441441 is 1441440353521.
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., 1249510374225 + 4020067216 = 1117815^2 + 63404^2 .
It is a cyclic number.
It is not a de Polignac number, because 1253530441441 - 211 = 1253530439393 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1253530441441.
It is not a weakly prime, because it can be changed into another prime (1253530441451) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 626765220720 + 626765220721.
It is an arithmetic number, because the mean of its divisors is an integer number (626765220721).
Almost surely, 21253530441441 is an apocalyptic number.
It is an amenable number.
1253530441441 is a deficient number, since it is larger than the sum of its proper divisors (1).
1253530441441 is an equidigital number, since it uses as much as digits as its factorization.
1253530441441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 115200, while the sum is 37.
Adding to 1253530441441 its reverse (1441440353521), we get a palindrome (2694970794962).
The spelling of 1253530441441 in words is "one trillion, two hundred fifty-three billion, five hundred thirty million, four hundred forty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •