Base | Representation |
---|---|
bin | 1011010100010101100001… |
… | …0000101000111011001101 |
3 | 1122001122010211022112221012 |
4 | 2311011120100220323031 |
5 | 3112340303224412303 |
6 | 42244410052415005 |
7 | 2423022642241412 |
oct | 265053020507315 |
9 | 48048124275835 |
10 | 12444001013453 |
11 | 3a68520180929 |
12 | 148b892917465 |
13 | 6c3605c98259 |
14 | 310415888109 |
15 | 168a6c6c65d8 |
hex | b5158428ecd |
12444001013453 has 2 divisors, whose sum is σ = 12444001013454. Its totient is φ = 12444001013452.
The previous prime is 12444001013401. The next prime is 12444001013491. The reversal of 12444001013453 is 35431010044421.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12436780602724 + 7220410729 = 3526582^2 + 84973^2 .
It is a cyclic number.
It is not a de Polignac number, because 12444001013453 - 242 = 8045954502349 is a prime.
It is a super-2 number, since 2×124440010134532 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12444001013053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6222000506726 + 6222000506727.
It is an arithmetic number, because the mean of its divisors is an integer number (6222000506727).
Almost surely, 212444001013453 is an apocalyptic number.
It is an amenable number.
12444001013453 is a deficient number, since it is larger than the sum of its proper divisors (1).
12444001013453 is an equidigital number, since it uses as much as digits as its factorization.
12444001013453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 12444001013453 its reverse (35431010044421), we get a palindrome (47875011057874).
The spelling of 12444001013453 in words is "twelve trillion, four hundred forty-four billion, one million, thirteen thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •