Base | Representation |
---|---|
bin | 100011110001110… |
… | …0100000010110101 |
3 | 10002122221222021122 |
4 | 1013203210002311 |
5 | 4424312130023 |
6 | 315042553325 |
7 | 41515060421 |
oct | 10743440265 |
9 | 3078858248 |
10 | 1200505013 |
11 | 566721204 |
12 | 296068845 |
13 | 1619402c6 |
14 | b5621b81 |
15 | 705da2c8 |
hex | 478e40b5 |
1200505013 has 2 divisors, whose sum is σ = 1200505014. Its totient is φ = 1200505012.
The previous prime is 1200504971. The next prime is 1200505021. The reversal of 1200505013 is 3105050021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1012321489 + 188183524 = 31817^2 + 13718^2 .
It is an emirp because it is prime and its reverse (3105050021) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1200505013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1200504982 and 1200505000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1200505043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600252506 + 600252507.
It is an arithmetic number, because the mean of its divisors is an integer number (600252507).
Almost surely, 21200505013 is an apocalyptic number.
It is an amenable number.
1200505013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1200505013 is an equidigital number, since it uses as much as digits as its factorization.
1200505013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 150, while the sum is 17.
The square root of 1200505013 is about 34648.3046194182. The cubic root of 1200505013 is about 1062.8076194956.
Adding to 1200505013 its reverse (3105050021), we get a palindrome (4305555034).
The spelling of 1200505013 in words is "one billion, two hundred million, five hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •