Base | Representation |
---|---|
bin | 101101001010000111000… |
… | …111010100010100100001 |
3 | 101222122222122210201121021 |
4 | 231022013013110110201 |
5 | 401320410201330423 |
6 | 10333334453525441 |
7 | 440126004143332 |
oct | 55120707242441 |
9 | 11878878721537 |
10 | 3103233230113 |
11 | a9708a291485 |
12 | 421516643881 |
13 | 196831144453 |
14 | aa2a9512289 |
15 | 55ac774295d |
hex | 2d2871d4521 |
3103233230113 has 4 divisors (see below), whose sum is σ = 3120378165268. Its totient is φ = 3086088294960.
The previous prime is 3103233230011. The next prime is 3103233230197. The reversal of 3103233230113 is 3110323323013.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1183933319569 + 1919299910544 = 1088087^2 + 1385388^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3103233230113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3103233234113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8572467306 + ... + 8572467667.
It is an arithmetic number, because the mean of its divisors is an integer number (780094541317).
Almost surely, 23103233230113 is an apocalyptic number.
It is an amenable number.
3103233230113 is a deficient number, since it is larger than the sum of its proper divisors (17144935155).
3103233230113 is a wasteful number, since it uses less digits than its factorization.
3103233230113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17144935154.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 3103233230113 its reverse (3110323323013), we get a palindrome (6213556553126).
The spelling of 3103233230113 in words is "three trillion, one hundred three billion, two hundred thirty-three million, two hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •