Base | Representation |
---|---|
bin | 1001011000111111101000… |
… | …1101110101000100010001 |
3 | 1100120001122022020102211111 |
4 | 2112033322031311010101 |
5 | 2323131102102412041 |
6 | 33543124100013321 |
7 | 2113646142562552 |
oct | 226177215650421 |
9 | 40501568212744 |
10 | 10325004341521 |
11 | 332089a862181 |
12 | 11a907b091241 |
13 | 59b84a38078c |
14 | 279a39028329 |
15 | 12d89c880981 |
hex | 963fa375111 |
10325004341521 has 2 divisors, whose sum is σ = 10325004341522. Its totient is φ = 10325004341520.
The previous prime is 10325004341429. The next prime is 10325004341573. The reversal of 10325004341521 is 12514340052301.
10325004341521 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., 10324654240000 + 350101521 = 3213200^2 + 18711^2 .
It is a cyclic number.
It is not a de Polignac number, because 10325004341521 - 29 = 10325004341009 is a prime.
It is not a weakly prime, because it can be changed into another prime (10325004344521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5162502170760 + 5162502170761.
It is an arithmetic number, because the mean of its divisors is an integer number (5162502170761).
Almost surely, 210325004341521 is an apocalyptic number.
It is an amenable number.
10325004341521 is a deficient number, since it is larger than the sum of its proper divisors (1).
10325004341521 is an equidigital number, since it uses as much as digits as its factorization.
10325004341521 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 10325004341521 its reverse (12514340052301), we get a palindrome (22839344393822).
The spelling of 10325004341521 in words is "ten trillion, three hundred twenty-five billion, four million, three hundred forty-one thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •