Base | Representation |
---|---|
bin | 1001100111111010100000… |
… | …1000110001010000000111 |
3 | 1101110120020202101100000002 |
4 | 2121332220020301100013 |
5 | 2341331023240234343 |
6 | 34300554352111515 |
7 | 2141322051136556 |
oct | 231765010612007 |
9 | 41416222340002 |
10 | 10581325321223 |
11 | 340a57331aa98 |
12 | 122a89453559b |
13 | 5b9a78b70537 |
14 | 2881d311dd9d |
15 | 1353a05878b8 |
hex | 99fa8231407 |
10581325321223 has 2 divisors, whose sum is σ = 10581325321224. Its totient is φ = 10581325321222.
The previous prime is 10581325321211. The next prime is 10581325321309. The reversal of 10581325321223 is 32212352318501.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10581325321223 - 210 = 10581325320199 is a prime.
It is a super-2 number, since 2×105813253212232 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10581325324223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5290662660611 + 5290662660612.
It is an arithmetic number, because the mean of its divisors is an integer number (5290662660612).
Almost surely, 210581325321223 is an apocalyptic number.
10581325321223 is a deficient number, since it is larger than the sum of its proper divisors (1).
10581325321223 is an equidigital number, since it uses as much as digits as its factorization.
10581325321223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 86400, while the sum is 38.
Adding to 10581325321223 its reverse (32212352318501), we get a palindrome (42793677639724).
The spelling of 10581325321223 in words is "ten trillion, five hundred eighty-one billion, three hundred twenty-five million, three hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •