Base | Representation |
---|---|
bin | 101010000010001… |
… | …1010001100011101 |
3 | 10122021222212201002 |
4 | 1110010122030131 |
5 | 10342033121023 |
6 | 351542400045 |
7 | 46644362561 |
oct | 12404321435 |
9 | 3567885632 |
10 | 1410442013 |
11 | 664180a62 |
12 | 334430025 |
13 | 196296596 |
14 | d546d6a1 |
15 | 83c58b28 |
hex | 5411a31d |
1410442013 has 2 divisors, whose sum is σ = 1410442014. Its totient is φ = 1410442012.
The previous prime is 1410442003. The next prime is 1410442021. The reversal of 1410442013 is 3102440141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1110355684 + 300086329 = 33322^2 + 17323^2 .
It is an emirp because it is prime and its reverse (3102440141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1410442013 - 24 = 1410441997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1410442003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 705221006 + 705221007.
It is an arithmetic number, because the mean of its divisors is an integer number (705221007).
Almost surely, 21410442013 is an apocalyptic number.
It is an amenable number.
1410442013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1410442013 is an equidigital number, since it uses as much as digits as its factorization.
1410442013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
The square root of 1410442013 is about 37555.8519141824. The cubic root of 1410442013 is about 1121.4633330548.
Adding to 1410442013 its reverse (3102440141), we get a palindrome (4512882154).
The spelling of 1410442013 in words is "one billion, four hundred ten million, four hundred forty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •