Base | Representation |
---|---|
bin | 10001101011000010010… |
… | …000111100111000010001 |
3 | 11022002200102010011111211 |
4 | 101223002100330320101 |
5 | 124344133120013131 |
6 | 2325523411540121 |
7 | 153511645454311 |
oct | 21530220747021 |
9 | 4262612104454 |
10 | 1214440001041 |
11 | 42904a7a1653 |
12 | 1774495ba641 |
13 | 8a6a1102317 |
14 | 42aca219441 |
15 | 218cc7845b1 |
hex | 11ac243ce11 |
1214440001041 has 2 divisors, whose sum is σ = 1214440001042. Its totient is φ = 1214440001040.
The previous prime is 1214440001017. The next prime is 1214440001053. The reversal of 1214440001041 is 1401000444121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 698722122816 + 515717878225 = 835896^2 + 718135^2 .
It is a cyclic number.
It is not a de Polignac number, because 1214440001041 - 25 = 1214440001009 is a prime.
It is a super-2 number, since 2×12144400010412 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1214440091041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 607220000520 + 607220000521.
It is an arithmetic number, because the mean of its divisors is an integer number (607220000521).
Almost surely, 21214440001041 is an apocalyptic number.
It is an amenable number.
1214440001041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1214440001041 is an equidigital number, since it uses as much as digits as its factorization.
1214440001041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 1214440001041 its reverse (1401000444121), we get a palindrome (2615440445162).
The spelling of 1214440001041 in words is "one trillion, two hundred fourteen billion, four hundred forty million, one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •