Base | Representation |
---|---|
bin | 111110000111000… |
… | …010001001101101 |
3 | 2200121202200002122 |
4 | 332013002021231 |
5 | 4113224444323 |
6 | 251222202325 |
7 | 34552055606 |
oct | 7607021155 |
9 | 2617680078 |
10 | 1042031213 |
11 | 495221523 |
12 | 250b833a5 |
13 | 137b65422 |
14 | 9c56cdad |
15 | 61734ec8 |
hex | 3e1c226d |
1042031213 has 2 divisors, whose sum is σ = 1042031214. Its totient is φ = 1042031212.
The previous prime is 1042031209. The next prime is 1042031233. The reversal of 1042031213 is 3121302401.
1042031213 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., 904625929 + 137405284 = 30077^2 + 11722^2 .
It is a cyclic number.
It is not a de Polignac number, because 1042031213 - 22 = 1042031209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1042031191 and 1042031200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1042031203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 521015606 + 521015607.
It is an arithmetic number, because the mean of its divisors is an integer number (521015607).
Almost surely, 21042031213 is an apocalyptic number.
It is an amenable number.
1042031213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1042031213 is an equidigital number, since it uses as much as digits as its factorization.
1042031213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 1042031213 is about 32280.5082518848. The cubic root of 1042031213 is about 1013.8185718401.
Adding to 1042031213 its reverse (3121302401), we get a palindrome (4163333614).
The spelling of 1042031213 in words is "one billion, forty-two million, thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •