Base | Representation |
---|---|
bin | 11111010101100010100… |
… | …000100011001111111101 |
3 | 21121212101022221020202011 |
4 | 133111202200203033331 |
5 | 240240211404043303 |
6 | 4325134522331221 |
7 | 311403015111325 |
oct | 37254240431775 |
9 | 7555338836664 |
10 | 2153431315453 |
11 | 7602a0924030 |
12 | 2a9423959b11 |
13 | 1280b59822b2 |
14 | 76325c40285 |
15 | 3b037e4d16d |
hex | 1f5628233fd |
2153431315453 has 32 divisors (see below), whose sum is σ = 2586853584000. Its totient is φ = 1770556677120.
The previous prime is 2153431315439. The next prime is 2153431315459. The reversal of 2153431315453 is 3545131343512.
It is a de Polignac number, because none of the positive numbers 2k-2153431315453 is a prime.
It is a super-3 number, since 3×21534313154533 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2153431315459) 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 in 31 ways as a sum of consecutive naturals, for example, 1456600 + ... + 2535457.
It is an arithmetic number, because the mean of its divisors is an integer number (80839174500).
Almost surely, 22153431315453 is an apocalyptic number.
It is an amenable number.
2153431315453 is a deficient number, since it is larger than the sum of its proper divisors (433422268547).
2153431315453 is a wasteful number, since it uses less digits than its factorization.
2153431315453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3992205.
The product of its digits is 324000, while the sum is 40.
Adding to 2153431315453 its reverse (3545131343512), we get a palindrome (5698562658965).
The spelling of 2153431315453 in words is "two trillion, one hundred fifty-three billion, four hundred thirty-one million, three hundred fifteen thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •