Base | Representation |
---|---|
bin | 10101100010000011… |
… | …11001101000001101 |
3 | 1002211122011211211122 |
4 | 22301001321220031 |
5 | 142133330000023 |
6 | 5151030530325 |
7 | 556316243642 |
oct | 126101715015 |
9 | 32748154748 |
10 | 11560000013 |
11 | 49a2356121 |
12 | 22a75069a5 |
13 | 1122c596c3 |
14 | 7b9403dc9 |
15 | 479d0a2c8 |
hex | 2b1079a0d |
11560000013 has 2 divisors, whose sum is σ = 11560000014. Its totient is φ = 11560000012.
The previous prime is 11559999973. The next prime is 11560000033. The reversal of 11560000013 is 31000006511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11513719204 + 46280809 = 107302^2 + 6803^2 .
It is a cyclic number.
It is not a de Polignac number, because 11560000013 - 212 = 11559995917 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11559999946 and 11560000000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11560000033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5780000006 + 5780000007.
It is an arithmetic number, because the mean of its divisors is an integer number (5780000007).
Almost surely, 211560000013 is an apocalyptic number.
It is an amenable number.
11560000013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11560000013 is an equidigital number, since it uses as much as digits as its factorization.
11560000013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 17.
Adding to 11560000013 its reverse (31000006511), we get a palindrome (42560006524).
The spelling of 11560000013 in words is "eleven billion, five hundred sixty million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •