Base | Representation |
---|---|
bin | 1001100100111011010110… |
… | …0011100001010011011111 |
3 | 1101021122210120010002110212 |
4 | 2121032311203201103133 |
5 | 2340010430233030142 |
6 | 34221230432323035 |
7 | 2134524325150202 |
oct | 231166543412337 |
9 | 41248716102425 |
10 | 10530010830047 |
11 | 339a8306622a5 |
12 | 12209533a347b |
13 | 5b4c8b9909a7 |
14 | 285925db9939 |
15 | 133d9a5ddd82 |
hex | 993b58e14df |
10530010830047 has 2 divisors, whose sum is σ = 10530010830048. Its totient is φ = 10530010830046.
The previous prime is 10530010829993. The next prime is 10530010830121. The reversal of 10530010830047 is 74003801003501.
It is a weak prime.
It is an emirp because it is prime and its reverse (74003801003501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10530010830047 - 220 = 10530009781471 is a prime.
It is a super-2 number, since 2×105300108300472 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10530010829995 and 10530010830022.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10530010830347) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5265005415023 + 5265005415024.
It is an arithmetic number, because the mean of its divisors is an integer number (5265005415024).
Almost surely, 210530010830047 is an apocalyptic number.
10530010830047 is a deficient number, since it is larger than the sum of its proper divisors (1).
10530010830047 is an equidigital number, since it uses as much as digits as its factorization.
10530010830047 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10080, while the sum is 32.
Adding to 10530010830047 its reverse (74003801003501), we get a palindrome (84533811833548).
The spelling of 10530010830047 in words is "ten trillion, five hundred thirty billion, ten million, eight hundred thirty thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •