Base | Representation |
---|---|
bin | 1010111101100101000000… |
… | …1000001000101001110101 |
3 | 1120200020221212100100012002 |
4 | 2233121100020020221311 |
5 | 3034434042232324303 |
6 | 41345025423105045 |
7 | 2352542064126254 |
oct | 257312010105165 |
9 | 46606855310162 |
10 | 12053022542453 |
11 | 3927727004822 |
12 | 1427b58a42185 |
13 | 695797707569 |
14 | 2d952590279b |
15 | 15d7d7d0d788 |
hex | af650208a75 |
12053022542453 has 2 divisors, whose sum is σ = 12053022542454. Its totient is φ = 12053022542452.
The previous prime is 12053022542447. The next prime is 12053022542489. The reversal of 12053022542453 is 35424522035021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6391178374084 + 5661844168369 = 2528078^2 + 2379463^2 .
It is a cyclic number.
It is not a de Polignac number, because 12053022542453 - 24 = 12053022542437 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12053022542053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6026511271226 + 6026511271227.
It is an arithmetic number, because the mean of its divisors is an integer number (6026511271227).
Almost surely, 212053022542453 is an apocalyptic number.
It is an amenable number.
12053022542453 is a deficient number, since it is larger than the sum of its proper divisors (1).
12053022542453 is an equidigital number, since it uses as much as digits as its factorization.
12053022542453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288000, while the sum is 38.
Adding to 12053022542453 its reverse (35424522035021), we get a palindrome (47477544577474).
The spelling of 12053022542453 in words is "twelve trillion, fifty-three billion, twenty-two million, five hundred forty-two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •