Base | Representation |
---|---|
bin | 111011101000010… |
… | …000110100101101 |
3 | 2120201110010002112 |
4 | 323220100310231 |
5 | 4022101113123 |
6 | 243134133405 |
7 | 33535230302 |
oct | 7350206455 |
9 | 2521403075 |
10 | 1000410413 |
11 | 473784172 |
12 | 23b051265 |
13 | 12c351c32 |
14 | 96c170a9 |
15 | 5cc62d78 |
hex | 3ba10d2d |
1000410413 has 2 divisors, whose sum is σ = 1000410414. Its totient is φ = 1000410412.
The previous prime is 1000410409. The next prime is 1000410421. The reversal of 1000410413 is 3140140001.
It is a happy number.
1000410413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 830707684 + 169702729 = 28822^2 + 13027^2 .
It is an emirp because it is prime and its reverse (3140140001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1000410413 - 22 = 1000410409 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000418413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500205206 + 500205207.
It is an arithmetic number, because the mean of its divisors is an integer number (500205207).
Almost surely, 21000410413 is an apocalyptic number.
It is an amenable number.
1000410413 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000410413 is an equidigital number, since it uses as much as digits as its factorization.
1000410413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 1000410413 is about 31629.2651353142. The cubic root of 1000410413 is about 1000.1367856222.
Adding to 1000410413 its reverse (3140140001), we get a palindrome (4140550414).
The spelling of 1000410413 in words is "one billion, four hundred ten thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •