Base | Representation |
---|---|
bin | 1001011000101110110111… |
… | …1011100000000111011111 |
3 | 1100112122000121121221202102 |
4 | 2112023231323200013133 |
5 | 2323042342312240411 |
6 | 33541101305515315 |
7 | 2113426456066166 |
oct | 226135573400737 |
9 | 40478017557672 |
10 | 10320503243231 |
11 | 33199a0031435 |
12 | 11a82237a2b3b |
13 | 59b2b09b10cc |
14 | 27972d3143dd |
15 | 12d6d7626d3b |
hex | 962edee01df |
10320503243231 has 2 divisors, whose sum is σ = 10320503243232. Its totient is φ = 10320503243230.
The previous prime is 10320503243159. The next prime is 10320503243243. The reversal of 10320503243231 is 13234230502301.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10320503243231 is a prime.
It is a super-2 number, since 2×103205032432312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10320503243194 and 10320503243203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10320503243251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5160251621615 + 5160251621616.
It is an arithmetic number, because the mean of its divisors is an integer number (5160251621616).
Almost surely, 210320503243231 is an apocalyptic number.
10320503243231 is a deficient number, since it is larger than the sum of its proper divisors (1).
10320503243231 is an equidigital number, since it uses as much as digits as its factorization.
10320503243231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 29.
Adding to 10320503243231 its reverse (13234230502301), we get a palindrome (23554733745532).
The spelling of 10320503243231 in words is "ten trillion, three hundred twenty billion, five hundred three million, two hundred forty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •