Base | Representation |
---|---|
bin | 111100000011010… |
… | …110101010010101 |
3 | 2121012210220221011 |
4 | 330003112222111 |
5 | 4030410342323 |
6 | 243550252221 |
7 | 33652466251 |
oct | 7403265225 |
9 | 2535726834 |
10 | 1007512213 |
11 | 477794924 |
12 | 2414b7071 |
13 | 13096a596 |
14 | 97b45261 |
15 | 5d6b720d |
hex | 3c0d6a95 |
1007512213 has 2 divisors, whose sum is σ = 1007512214. Its totient is φ = 1007512212.
The previous prime is 1007512211. The next prime is 1007512237. The reversal of 1007512213 is 3122157001.
It is a happy number.
1007512213 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., 517244049 + 490268164 = 22743^2 + 22142^2 .
It is a cyclic number.
It is not a de Polignac number, because 1007512213 - 21 = 1007512211 is a prime.
Together with 1007512211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1007512211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 503756106 + 503756107.
It is an arithmetic number, because the mean of its divisors is an integer number (503756107).
Almost surely, 21007512213 is an apocalyptic number.
It is an amenable number.
1007512213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1007512213 is an equidigital number, since it uses as much as digits as its factorization.
1007512213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 420, while the sum is 22.
The square root of 1007512213 is about 31741.3328800162. The cubic root of 1007512213 is about 1002.4978266672.
Adding to 1007512213 its reverse (3122157001), we get a palindrome (4129669214).
The spelling of 1007512213 in words is "one billion, seven million, five hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •