Base | Representation |
---|---|
bin | 101001110110000… |
… | …1110010111101001 |
3 | 10121212001210000021 |
4 | 1103230032113221 |
5 | 10333422231441 |
6 | 351154440441 |
7 | 46536446122 |
oct | 12354162751 |
9 | 3555053007 |
10 | 1404102121 |
11 | 660640784 |
12 | 332293121 |
13 | 194b86976 |
14 | d469d049 |
15 | 834053d1 |
hex | 53b0e5e9 |
1404102121 has 2 divisors, whose sum is σ = 1404102122. Its totient is φ = 1404102120.
The previous prime is 1404102103. The next prime is 1404102143. The reversal of 1404102121 is 1212014041.
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., 1184736400 + 219365721 = 34420^2 + 14811^2 .
It is a cyclic number.
It is not a de Polignac number, because 1404102121 - 221 = 1402004969 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1404102095 and 1404102104.
It is not a weakly prime, because it can be changed into another prime (1404100121) 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, 702051060 + 702051061.
It is an arithmetic number, because the mean of its divisors is an integer number (702051061).
Almost surely, 21404102121 is an apocalyptic number.
It is an amenable number.
1404102121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1404102121 is an equidigital number, since it uses as much as digits as its factorization.
1404102121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 16.
The square root of 1404102121 is about 37471.3506695449. The cubic root of 1404102121 is about 1119.7804950887.
Adding to 1404102121 its reverse (1212014041), we get a palindrome (2616116162).
The spelling of 1404102121 in words is "one billion, four hundred four million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •