Base | Representation |
---|---|
bin | 10000101001011101101… |
… | …101010111011110010101 |
3 | 11001100221122211000222221 |
4 | 100221131231113132111 |
5 | 122220440032140303 |
6 | 2233321155422341 |
7 | 145440134041042 |
oct | 20513555273625 |
9 | 4040848730887 |
10 | 1144033474453 |
11 | 4012000870a1 |
12 | 16587a5b49b1 |
13 | 83b6069c7bc |
14 | 3d52b6201c9 |
15 | 1eb5b6214bd |
hex | 10a5db57795 |
1144033474453 has 2 divisors, whose sum is σ = 1144033474454. Its totient is φ = 1144033474452.
The previous prime is 1144033474411. The next prime is 1144033474457. The reversal of 1144033474453 is 3544743304411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1062387841284 + 81645633169 = 1030722^2 + 285737^2 .
It is a cyclic number.
It is not a de Polignac number, because 1144033474453 - 221 = 1144031377301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1144033474457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572016737226 + 572016737227.
It is an arithmetic number, because the mean of its divisors is an integer number (572016737227).
Almost surely, 21144033474453 is an apocalyptic number.
It is an amenable number.
1144033474453 is a deficient number, since it is larger than the sum of its proper divisors (1).
1144033474453 is an equidigital number, since it uses as much as digits as its factorization.
1144033474453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 967680, while the sum is 43.
Adding to 1144033474453 its reverse (3544743304411), we get a palindrome (4688776778864).
The spelling of 1144033474453 in words is "one trillion, one hundred forty-four billion, thirty-three million, four hundred seventy-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •