Base | Representation |
---|---|
bin | 10100100010010011011… |
… | …000110110111101011101 |
3 | 11222220121111020111220021 |
4 | 110202103120312331131 |
5 | 141110140320243123 |
6 | 3000150105552141 |
7 | 203646253265023 |
oct | 24422330667535 |
9 | 4886544214807 |
10 | 1411222040413 |
11 | 4a4550062359 |
12 | 1a96074a5651 |
13 | a3101834883 |
14 | 4c436b98713 |
15 | 26a9845dc5d |
hex | 14893636f5d |
1411222040413 has 4 divisors (see below), whose sum is σ = 1425770721340. Its totient is φ = 1396673359488.
The previous prime is 1411222040407. The next prime is 1411222040453. The reversal of 1411222040413 is 3140402221141.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 331081707609 + 1080140332804 = 575397^2 + 1039298^2 .
It is a cyclic number.
It is not a de Polignac number, because 1411222040413 - 25 = 1411222040381 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1411222040453) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7274340318 + ... + 7274340511.
It is an arithmetic number, because the mean of its divisors is an integer number (356442680335).
Almost surely, 21411222040413 is an apocalyptic number.
It is an amenable number.
1411222040413 is a deficient number, since it is larger than the sum of its proper divisors (14548680927).
1411222040413 is an equidigital number, since it uses as much as digits as its factorization.
1411222040413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14548680926.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 1411222040413 its reverse (3140402221141), we get a palindrome (4551624261554).
The spelling of 1411222040413 in words is "one trillion, four hundred eleven billion, two hundred twenty-two million, forty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •