Base | Representation |
---|---|
bin | 111100010101000… |
… | …001100010111001 |
3 | 2121112112020222102 |
4 | 330111001202321 |
5 | 4033102104223 |
6 | 244233433145 |
7 | 34040041025 |
oct | 7425014271 |
9 | 2545466872 |
10 | 1012144313 |
11 | 47a369004 |
12 | 242b6b7b5 |
13 | 1318cca7b |
14 | 985cd385 |
15 | 5dcce928 |
hex | 3c5418b9 |
1012144313 has 2 divisors, whose sum is σ = 1012144314. Its totient is φ = 1012144312.
The previous prime is 1012144271. The next prime is 1012144333. The reversal of 1012144313 is 3134412101.
It is an a-pointer prime, because the next prime (1012144333) can be obtained adding 1012144313 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 524043664 + 488100649 = 22892^2 + 22093^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012144313 - 218 = 1011882169 is a prime.
It is a super-2 number, since 2×10121443132 = 2048872220676483938, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1012144333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506072156 + 506072157.
It is an arithmetic number, because the mean of its divisors is an integer number (506072157).
Almost surely, 21012144313 is an apocalyptic number.
It is an amenable number.
1012144313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012144313 is an equidigital number, since it uses as much as digits as its factorization.
1012144313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 1012144313 is about 31814.2155804603. The cubic root of 1012144313 is about 1004.0318268589.
Adding to 1012144313 its reverse (3134412101), we get a palindrome (4146556414).
The spelling of 1012144313 in words is "one billion, twelve million, one hundred forty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •