Base | Representation |
---|---|
bin | 10100100011100010001… |
… | …101101100101000110101 |
3 | 12000001000122201011110012 |
4 | 110203202031230220311 |
5 | 141120342343431423 |
6 | 3000525231110005 |
7 | 204024112160651 |
oct | 24434215545065 |
9 | 5001018634405 |
10 | 1412544514613 |
11 | 4a506960a841 |
12 | 1a9916372305 |
13 | a328280b19b |
14 | 4c520689a61 |
15 | 26b245dd078 |
hex | 148e236ca35 |
1412544514613 has 2 divisors, whose sum is σ = 1412544514614. Its totient is φ = 1412544514612.
The previous prime is 1412544514543. The next prime is 1412544514621. The reversal of 1412544514613 is 3164154452141.
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., 880581422449 + 531963092164 = 938393^2 + 729358^2 .
It is a cyclic number.
It is not a de Polignac number, because 1412544514613 - 216 = 1412544449077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1412544514663) 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, 706272257306 + 706272257307.
It is an arithmetic number, because the mean of its divisors is an integer number (706272257307).
Almost surely, 21412544514613 is an apocalyptic number.
It is an amenable number.
1412544514613 is a deficient number, since it is larger than the sum of its proper divisors (1).
1412544514613 is an equidigital number, since it uses as much as digits as its factorization.
1412544514613 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 230400, while the sum is 41.
Adding to 1412544514613 its reverse (3164154452141), we get a palindrome (4576698966754).
The spelling of 1412544514613 in words is "one trillion, four hundred twelve billion, five hundred forty-four million, five hundred fourteen thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •