Base | Representation |
---|---|
bin | 10011100010001100… |
… | …01110000111111001 |
3 | 1000001212212122111021 |
4 | 21301012032013321 |
5 | 132434233000323 |
6 | 4452353102441 |
7 | 520613231062 |
oct | 116106160771 |
9 | 30055778437 |
10 | 10487390713 |
11 | 44a1949958 |
12 | 2048257a21 |
13 | cb1979147 |
14 | 716b95569 |
15 | 415a8505d |
hex | 27118e1f9 |
10487390713 has 2 divisors, whose sum is σ = 10487390714. Its totient is φ = 10487390712.
The previous prime is 10487390647. The next prime is 10487390773. The reversal of 10487390713 is 31709378401.
10487390713 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10394210304 + 93180409 = 101952^2 + 9653^2 .
It is a cyclic number.
It is not a de Polignac number, because 10487390713 - 229 = 9950519801 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10487390713.
It is not a weakly prime, because it can be changed into another prime (10487390773) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5243695356 + 5243695357.
It is an arithmetic number, because the mean of its divisors is an integer number (5243695357).
Almost surely, 210487390713 is an apocalyptic number.
It is an amenable number.
10487390713 is a deficient number, since it is larger than the sum of its proper divisors (1).
10487390713 is an equidigital number, since it uses as much as digits as its factorization.
10487390713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 127008, while the sum is 43.
The spelling of 10487390713 in words is "ten billion, four hundred eighty-seven million, three hundred ninety thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •