Base | Representation |
---|---|
bin | 10100011100110101100… |
… | …101111011010011000101 |
3 | 11222100110111102202012012 |
4 | 110130311211323103011 |
5 | 141011130440043303 |
6 | 2553335505304005 |
7 | 203350653101114 |
oct | 24346545732305 |
9 | 4870414382165 |
10 | 1405353440453 |
11 | 4a200941a346 |
12 | 1a844a035005 |
13 | a26a7a54911 |
14 | 4c03b5d1c7b |
15 | 2685312e5d8 |
hex | 1473597b4c5 |
1405353440453 has 2 divisors, whose sum is σ = 1405353440454. Its totient is φ = 1405353440452.
The previous prime is 1405353440417. The next prime is 1405353440479. The reversal of 1405353440453 is 3540443535041.
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., 1008935873764 + 396417566689 = 1004458^2 + 629617^2 .
It is a cyclic number.
It is not a de Polignac number, because 1405353440453 - 210 = 1405353439429 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1405353440453.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1405353442453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 702676720226 + 702676720227.
It is an arithmetic number, because the mean of its divisors is an integer number (702676720227).
Almost surely, 21405353440453 is an apocalyptic number.
It is an amenable number.
1405353440453 is a deficient number, since it is larger than the sum of its proper divisors (1).
1405353440453 is an equidigital number, since it uses as much as digits as its factorization.
1405353440453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864000, while the sum is 41.
Adding to 1405353440453 its reverse (3540443535041), we get a palindrome (4945796975494).
The spelling of 1405353440453 in words is "one trillion, four hundred five billion, three hundred fifty-three million, four hundred forty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •