Base | Representation |
---|---|
bin | 10000100101101110101… |
… | …111101011010101000001 |
3 | 11000222121020220011110111 |
4 | 100211232233223111001 |
5 | 122134232211403231 |
6 | 2231415301431321 |
7 | 145235602611001 |
oct | 20455657532501 |
9 | 4028536804414 |
10 | 1140024325441 |
11 | 3aa533014101 |
12 | 164b3ba0b541 |
13 | 83671bc6991 |
14 | 3d26ada8001 |
15 | 1e9c46904b1 |
hex | 1096ebeb541 |
1140024325441 has 2 divisors, whose sum is σ = 1140024325442. Its totient is φ = 1140024325440.
The previous prime is 1140024325439. The next prime is 1140024325457. The reversal of 1140024325441 is 1445234200411.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1009994850225 + 130029475216 = 1004985^2 + 360596^2 .
It is an emirp because it is prime and its reverse (1445234200411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1140024325441 - 21 = 1140024325439 is a prime.
Together with 1140024325439, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1140024320441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 570012162720 + 570012162721.
It is an arithmetic number, because the mean of its divisors is an integer number (570012162721).
Almost surely, 21140024325441 is an apocalyptic number.
It is an amenable number.
1140024325441 is a deficient number, since it is larger than the sum of its proper divisors (1).
1140024325441 is an equidigital number, since it uses as much as digits as its factorization.
1140024325441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15360, while the sum is 31.
Adding to 1140024325441 its reverse (1445234200411), we get a palindrome (2585258525852).
The spelling of 1140024325441 in words is "one trillion, one hundred forty billion, twenty-four million, three hundred twenty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •