Base | Representation |
---|---|
bin | 111111110111011… |
… | …101111100111101 |
3 | 2202200020002211021 |
4 | 333313131330331 |
5 | 4143301131323 |
6 | 254154024141 |
7 | 35360433622 |
oct | 7767357475 |
9 | 2680202737 |
10 | 1071505213 |
11 | 4aa9227a9 |
12 | 25aa18051 |
13 | 140cb4b6c |
14 | a2442349 |
15 | 6410805d |
hex | 3fdddf3d |
1071505213 has 2 divisors, whose sum is σ = 1071505214. Its totient is φ = 1071505212.
The previous prime is 1071505181. The next prime is 1071505231. The reversal of 1071505213 is 3125051701.
Together with next prime (1071505231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1021633369 + 49871844 = 31963^2 + 7062^2 .
It is a cyclic number.
It is not a de Polignac number, because 1071505213 - 25 = 1071505181 is a prime.
It is a super-2 number, since 2×10715052132 = 2296246842972350738, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1071505243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 535752606 + 535752607.
It is an arithmetic number, because the mean of its divisors is an integer number (535752607).
Almost surely, 21071505213 is an apocalyptic number.
It is an amenable number.
1071505213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1071505213 is an equidigital number, since it uses as much as digits as its factorization.
1071505213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1050, while the sum is 25.
The square root of 1071505213 is about 32733.8542338051. The cubic root of 1071505213 is about 1023.2885062669.
Adding to 1071505213 its reverse (3125051701), we get a palindrome (4196556914).
The spelling of 1071505213 in words is "one billion, seventy-one million, five hundred five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •