Base | Representation |
---|---|
bin | 10100100011010100011… |
… | …000011010101001101101 |
3 | 12000000102111000201201211 |
4 | 110203110120122221231 |
5 | 141114403441143001 |
6 | 3000450221034421 |
7 | 204015263460541 |
oct | 24432430325155 |
9 | 5000374021654 |
10 | 1412312443501 |
11 | 4a4a5a612333 |
12 | 1a98706b5a11 |
13 | a32467052bb |
14 | 4c4db919a21 |
15 | 26b0e04b351 |
hex | 148d461aa6d |
1412312443501 has 2 divisors, whose sum is σ = 1412312443502. Its totient is φ = 1412312443500.
The previous prime is 1412312443471. The next prime is 1412312443513. The reversal of 1412312443501 is 1053442132141.
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., 1102426501225 + 309885942276 = 1049965^2 + 556674^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1412312443501 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1412312243501) 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, 706156221750 + 706156221751.
It is an arithmetic number, because the mean of its divisors is an integer number (706156221751).
Almost surely, 21412312443501 is an apocalyptic number.
It is an amenable number.
1412312443501 is a deficient number, since it is larger than the sum of its proper divisors (1).
1412312443501 is an equidigital number, since it uses as much as digits as its factorization.
1412312443501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 1412312443501 its reverse (1053442132141), we get a palindrome (2465754575642).
The spelling of 1412312443501 in words is "one trillion, four hundred twelve billion, three hundred twelve million, four hundred forty-three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •