Base | Representation |
---|---|
bin | 1001010111110110000000… |
… | …1110101011010101100001 |
3 | 1100111011121222000211121002 |
4 | 2111331200032223111201 |
5 | 2322320113144101421 |
6 | 33530055023041345 |
7 | 2112346323146063 |
oct | 225754016532541 |
9 | 40434558024532 |
10 | 10305241003361 |
11 | 3313478986757 |
12 | 11a5284440255 |
13 | 599a1aa28445 |
14 | 278ac2349733 |
15 | 12d0e27b1b0b |
hex | 95f603ab561 |
10305241003361 has 2 divisors, whose sum is σ = 10305241003362. Its totient is φ = 10305241003360.
The previous prime is 10305241003357. The next prime is 10305241003399. The reversal of 10305241003361 is 16330014250301.
10305241003361 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8083445059600 + 2221795943761 = 2843140^2 + 1490569^2 .
It is a cyclic number.
It is not a de Polignac number, because 10305241003361 - 22 = 10305241003357 is a prime.
It is not a weakly prime, because it can be changed into another prime (10305241009361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5152620501680 + 5152620501681.
It is an arithmetic number, because the mean of its divisors is an integer number (5152620501681).
Almost surely, 210305241003361 is an apocalyptic number.
It is an amenable number.
10305241003361 is a deficient number, since it is larger than the sum of its proper divisors (1).
10305241003361 is an equidigital number, since it uses as much as digits as its factorization.
10305241003361 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6480, while the sum is 29.
Adding to 10305241003361 its reverse (16330014250301), we get a palindrome (26635255253662).
The spelling of 10305241003361 in words is "ten trillion, three hundred five billion, two hundred forty-one million, three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •