Base | Representation |
---|---|
bin | 111110000111010… |
… | …011010010100101 |
3 | 2200121220020101122 |
4 | 332013103102211 |
5 | 4113234221123 |
6 | 251223503325 |
7 | 34552500353 |
oct | 7607232245 |
9 | 2617806348 |
10 | 1042101413 |
11 | 49526a241 |
12 | 250bb7b45 |
13 | 137b8b372 |
14 | 9c58a7d3 |
15 | 6174abc8 |
hex | 3e1d34a5 |
1042101413 has 2 divisors, whose sum is σ = 1042101414. Its totient is φ = 1042101412.
The previous prime is 1042101407. The next prime is 1042101419. The reversal of 1042101413 is 3141012401.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (1042101407) and next prime (1042101419).
It can be written as a sum of positive squares in only one way, i.e., 1012703329 + 29398084 = 31823^2 + 5422^2 .
It is a cyclic number.
It is not a de Polignac number, because 1042101413 - 24 = 1042101397 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1042101391 and 1042101400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1042101419) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 521050706 + 521050707.
It is an arithmetic number, because the mean of its divisors is an integer number (521050707).
Almost surely, 21042101413 is an apocalyptic number.
It is an amenable number.
1042101413 is a deficient number, since it is larger than the sum of its proper divisors (1).
1042101413 is an equidigital number, since it uses as much as digits as its factorization.
1042101413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 1042101413 is about 32281.5955770467. The cubic root of 1042101413 is about 1013.8413377818.
Adding to 1042101413 its reverse (3141012401), we get a palindrome (4183113814).
The spelling of 1042101413 in words is "one billion, forty-two million, one hundred one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •