Base | Representation |
---|---|
bin | 1001100100100010110011… |
… | …1000111100101011100001 |
3 | 1101021000210102221201101001 |
4 | 2121020230320330223201 |
5 | 2334403432242020223 |
6 | 34214221020312001 |
7 | 2134202142424345 |
oct | 231105470745341 |
9 | 41230712851331 |
10 | 10523423001313 |
11 | 3397a5aa37042 |
12 | 121b6150a2601 |
13 | 5b447bb9b291 |
14 | 28549d0b1625 |
15 | 133b1208e9ad |
hex | 9922ce3cae1 |
10523423001313 has 2 divisors, whose sum is σ = 10523423001314. Its totient is φ = 10523423001312.
The previous prime is 10523423001283. The next prime is 10523423001349. The reversal of 10523423001313 is 31310032432501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6701507480529 + 3821915520784 = 2588727^2 + 1954972^2 .
It is a cyclic number.
It is not a de Polignac number, because 10523423001313 - 229 = 10522886130401 is a prime.
It is a super-2 number, since 2×105234230013132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10523423001613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5261711500656 + 5261711500657.
It is an arithmetic number, because the mean of its divisors is an integer number (5261711500657).
Almost surely, 210523423001313 is an apocalyptic number.
It is an amenable number.
10523423001313 is a deficient number, since it is larger than the sum of its proper divisors (1).
10523423001313 is an equidigital number, since it uses as much as digits as its factorization.
10523423001313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 10523423001313 its reverse (31310032432501), we get a palindrome (41833455433814).
The spelling of 10523423001313 in words is "ten trillion, five hundred twenty-three billion, four hundred twenty-three million, one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •