Base | Representation |
---|---|
bin | 10111011111011001000101… |
… | …001000001011100001010111 |
3 | 111112210120010000222120220020 |
4 | 113133121011020023201113 |
5 | 102020132044044011411 |
6 | 1003421003345440223 |
7 | 30522032116061025 |
oct | 2737310510134127 |
9 | 445716100876806 |
10 | 103312303110231 |
11 | 2aa11557839a46 |
12 | b706749340073 |
13 | 4585401685917 |
14 | 1b724b0c0b715 |
15 | be25cb868606 |
hex | 5df64520b857 |
103312303110231 has 8 divisors (see below), whose sum is σ = 137792030934384. Its totient is φ = 68853722013120.
The previous prime is 103312303110223. The next prime is 103312303110253. The reversal of 103312303110231 is 132011303213301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103312303110231 - 23 = 103312303110223 is a prime.
It is a super-2 number, since 2×1033123031102312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103312303110281) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5286670360 + ... + 5286689901.
It is an arithmetic number, because the mean of its divisors is an integer number (17224003866798).
Almost surely, 2103312303110231 is an apocalyptic number.
103312303110231 is a deficient number, since it is larger than the sum of its proper divisors (34479727824153).
103312303110231 is a wasteful number, since it uses less digits than its factorization.
103312303110231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10573363521.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 103312303110231 its reverse (132011303213301), we get a palindrome (235323606323532).
The spelling of 103312303110231 in words is "one hundred three trillion, three hundred twelve billion, three hundred three million, one hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •