Base | Representation |
---|---|
bin | 1001010111110110001111… |
… | …0001101110100001000001 |
3 | 1100111011210010000202021212 |
4 | 2111331203301232201001 |
5 | 2322320223413214243 |
6 | 33530104550455505 |
7 | 2112350645102663 |
oct | 225754361564101 |
9 | 40434703022255 |
10 | 10305300523073 |
11 | 33134a95397a6 |
12 | 11a52a0364595 |
13 | 599a2a1678ca |
14 | 278aca200533 |
15 | 12d0e7b1c318 |
hex | 95f63c6e841 |
10305300523073 has 2 divisors, whose sum is σ = 10305300523074. Its totient is φ = 10305300523072.
The previous prime is 10305300523051. The next prime is 10305300523093. The reversal of 10305300523073 is 37032500350301.
10305300523073 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., 7493752950784 + 2811547572289 = 2737472^2 + 1676767^2 .
It is a cyclic number.
It is not a de Polignac number, because 10305300523073 - 212 = 10305300518977 is a prime.
It is not a weakly prime, because it can be changed into another prime (10305300523043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5152650261536 + 5152650261537.
It is an arithmetic number, because the mean of its divisors is an integer number (5152650261537).
Almost surely, 210305300523073 is an apocalyptic number.
It is an amenable number.
10305300523073 is a deficient number, since it is larger than the sum of its proper divisors (1).
10305300523073 is an equidigital number, since it uses as much as digits as its factorization.
10305300523073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28350, while the sum is 32.
Adding to 10305300523073 its reverse (37032500350301), we get a palindrome (47337800873374).
The spelling of 10305300523073 in words is "ten trillion, three hundred five billion, three hundred million, five hundred twenty-three thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •