Base | Representation |
---|---|
bin | 1001100101000000001100… |
… | …0001100000001000111111 |
3 | 1101021210011010201221210220 |
4 | 2121100003001200020333 |
5 | 2340021110444111411 |
6 | 34222003421432423 |
7 | 2134601456362143 |
oct | 231200301401077 |
9 | 41253133657726 |
10 | 10531310535231 |
11 | 33a0338279012 |
12 | 122105670b713 |
13 | 5b5138024705 |
14 | 285a0a861223 |
15 | 133e24771b06 |
hex | 9940306023f |
10531310535231 has 16 divisors (see below), whose sum is σ = 14054301972480. Its totient is φ = 7014599208000.
The previous prime is 10531310535223. The next prime is 10531310535257. The reversal of 10531310535231 is 13253501313501.
It is not a de Polignac number, because 10531310535231 - 23 = 10531310535223 is a prime.
It is a super-2 number, since 2×105313105352312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10531310535192 and 10531310535201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10531310535281) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14716731 + ... + 15415731.
It is an arithmetic number, because the mean of its divisors is an integer number (878393873280).
Almost surely, 210531310535231 is an apocalyptic number.
10531310535231 is a deficient number, since it is larger than the sum of its proper divisors (3522991437249).
10531310535231 is a wasteful number, since it uses less digits than its factorization.
10531310535231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 703486.
The product of its (nonzero) digits is 20250, while the sum is 33.
Adding to 10531310535231 its reverse (13253501313501), we get a palindrome (23784811848732).
The spelling of 10531310535231 in words is "ten trillion, five hundred thirty-one billion, three hundred ten million, five hundred thirty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •