Base | Representation |
---|---|
bin | 10100100101001011000… |
… | …110110011001011111111 |
3 | 12000012120022002020112101 |
4 | 110211023012303023333 |
5 | 141132443401022421 |
6 | 3001420013445531 |
7 | 204115531213513 |
oct | 24451306631377 |
9 | 5005508066471 |
10 | 1414304314111 |
11 | 4a5891a07197 |
12 | 1aa1277a08a7 |
13 | a34a3294370 |
14 | 4c64a29a143 |
15 | 26bc8d55191 |
hex | 1494b1b32ff |
1414304314111 has 16 divisors (see below), whose sum is σ = 1538349236928. Its totient is φ = 1292441184000.
The previous prime is 1414304314069. The next prime is 1414304314117. The reversal of 1414304314111 is 1114134034141.
It is a cyclic number.
It is not a de Polignac number, because 1414304314111 - 29 = 1414304313599 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1414304314111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1414304314117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12708270 + ... + 12819076.
It is an arithmetic number, because the mean of its divisors is an integer number (96146827308).
Almost surely, 21414304314111 is an apocalyptic number.
1414304314111 is a deficient number, since it is larger than the sum of its proper divisors (124044922817).
1414304314111 is a wasteful number, since it uses less digits than its factorization.
1414304314111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120642.
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 1414304314111 its reverse (1114134034141), we get a palindrome (2528438348252).
The spelling of 1414304314111 in words is "one trillion, four hundred fourteen billion, three hundred four million, three hundred fourteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •