Base | Representation |
---|---|
bin | 101010001001110… |
… | …0001000100010001 |
3 | 10122120110002020011 |
4 | 1110103201010101 |
5 | 10344041333241 |
6 | 352203314521 |
7 | 50023135633 |
oct | 12423410421 |
9 | 3576402204 |
10 | 1414402321 |
11 | 666436442 |
12 | 33581ba41 |
13 | 197052067 |
14 | d5bc0a53 |
15 | 8428c281 |
hex | 544e1111 |
1414402321 has 2 divisors, whose sum is σ = 1414402322. Its totient is φ = 1414402320.
The previous prime is 1414402309. The next prime is 1414402357. The reversal of 1414402321 is 1232044141.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1264584721 + 149817600 = 35561^2 + 12240^2 .
It is a cyclic number.
It is not a de Polignac number, because 1414402321 - 227 = 1280184593 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1414402292 and 1414402301.
It is not a weakly prime, because it can be changed into another prime (1414402391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 707201160 + 707201161.
It is an arithmetic number, because the mean of its divisors is an integer number (707201161).
Almost surely, 21414402321 is an apocalyptic number.
It is an amenable number.
1414402321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1414402321 is an equidigital number, since it uses as much as digits as its factorization.
1414402321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 1414402321 is about 37608.5405327035. The cubic root of 1414402321 is about 1122.5119853615.
Adding to 1414402321 its reverse (1232044141), we get a palindrome (2646446462).
The spelling of 1414402321 in words is "one billion, four hundred fourteen million, four hundred two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •