Base | Representation |
---|---|
bin | 101001101110010… |
… | …0101100111001101 |
3 | 10121120100112002202 |
4 | 1103130211213031 |
5 | 10331400044041 |
6 | 350530531245 |
7 | 46456554314 |
oct | 12334454715 |
9 | 3546315082 |
10 | 1400003021 |
11 | 6592a0a9a |
12 | 330a36b25 |
13 | 19407cc71 |
14 | d3d1327b |
15 | 82d95a9b |
hex | 537259cd |
1400003021 has 2 divisors, whose sum is σ = 1400003022. Its totient is φ = 1400003020.
The previous prime is 1400002969. The next prime is 1400003029. The reversal of 1400003021 is 1203000041.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1398012100 + 1990921 = 37390^2 + 1411^2 .
It is a cyclic number.
It is not a de Polignac number, because 1400003021 - 230 = 326261197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1400002993 and 1400003011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1400003029) 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, 700001510 + 700001511.
It is an arithmetic number, because the mean of its divisors is an integer number (700001511).
Almost surely, 21400003021 is an apocalyptic number.
It is an amenable number.
1400003021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1400003021 is an equidigital number, since it uses as much as digits as its factorization.
1400003021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 11.
The square root of 1400003021 is about 37416.6142375282. The cubic root of 1400003021 is about 1118.6897467378.
Adding to 1400003021 its reverse (1203000041), we get a palindrome (2603003062).
The spelling of 1400003021 in words is "one billion, four hundred million, three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •