Base | Representation |
---|---|
bin | 101101001001001011100… |
… | …000001010111011110111 |
3 | 101222120101221220110220012 |
4 | 231021023200022323313 |
5 | 401311333134043221 |
6 | 10333051325530435 |
7 | 440062141242104 |
oct | 55111340127367 |
9 | 11876357813805 |
10 | 3102233112311 |
11 | a96716798143 |
12 | 421297713a1b |
13 | 196701b95778 |
14 | aa212773aab |
15 | 55a69a3b65b |
hex | 2d24b80aef7 |
3102233112311 has 8 divisors (see below), whose sum is σ = 3235318606464. Its totient is φ = 2971210959360.
The previous prime is 3102233112239. The next prime is 3102233112353. The reversal of 3102233112311 is 1132113322013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3102233112311 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3102233112361) 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, 515832230 + ... + 515838243.
It is an arithmetic number, because the mean of its divisors is an integer number (404414825808).
Almost surely, 23102233112311 is an apocalyptic number.
3102233112311 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
3102233112311 is a deficient number, since it is larger than the sum of its proper divisors (133085494153).
3102233112311 is a wasteful number, since it uses less digits than its factorization.
3102233112311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1031670601.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 3102233112311 its reverse (1132113322013), we get a palindrome (4234346434324).
The spelling of 3102233112311 in words is "three trillion, one hundred two billion, two hundred thirty-three million, one hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •