Base | Representation |
---|---|
bin | 10100100101000001100… |
… | …100111001110100001111 |
3 | 12000012011011020110110102 |
4 | 110211001210321310033 |
5 | 141132131433332143 |
6 | 3001352103001315 |
7 | 204111550232201 |
oct | 24450144716417 |
9 | 5005134213412 |
10 | 1414144433423 |
11 | 4a580a736497 |
12 | 1aa0a213923b |
13 | a3479115cc7 |
14 | 4c632d5c771 |
15 | 26bb9cc30b8 |
hex | 14941939d0f |
1414144433423 has 4 divisors (see below), whose sum is σ = 1414146870048. Its totient is φ = 1414141996800.
The previous prime is 1414144433419. The next prime is 1414144433459. The reversal of 1414144433423 is 3243344414141.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1414144433423 - 22 = 1414144433419 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 (1414144433483) 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 in 3 ways as a sum of consecutive naturals, for example, 211898 + ... + 1695048.
It is an arithmetic number, because the mean of its divisors is an integer number (353536717512).
Almost surely, 21414144433423 is an apocalyptic number.
1414144433423 is a deficient number, since it is larger than the sum of its proper divisors (2436625).
1414144433423 is an equidigital number, since it uses as much as digits as its factorization.
1414144433423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2436624.
The product of its digits is 221184, while the sum is 38.
Adding to 1414144433423 its reverse (3243344414141), we get a palindrome (4657488847564).
The spelling of 1414144433423 in words is "one trillion, four hundred fourteen billion, one hundred forty-four million, four hundred thirty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •