Base | Representation |
---|---|
bin | 101101010011001110100… |
… | …001100101000001110111 |
3 | 102000121020210122200220220 |
4 | 231103032201211001313 |
5 | 402000431413344343 |
6 | 10342034024425423 |
7 | 440623365604611 |
oct | 55231641450167 |
9 | 12017223580826 |
10 | 3113021231223 |
11 | aa02523685a2 |
12 | 4233a8618273 |
13 | 197730c35c97 |
14 | aa95744bdb1 |
15 | 55e9bbc6183 |
hex | 2d4ce865077 |
3113021231223 has 16 divisors (see below), whose sum is σ = 4258442928096. Its totient is φ = 2021628546560.
The previous prime is 3113021231171. The next prime is 3113021231231. The reversal of 3113021231223 is 3221321203113.
3113021231223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3113021231223 - 225 = 3112987676791 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3113021231193 and 3113021231202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3113021231233) 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, 19298790 + ... + 19459427.
It is an arithmetic number, because the mean of its divisors is an integer number (266152683006).
Almost surely, 23113021231223 is an apocalyptic number.
3113021231223 is a deficient number, since it is larger than the sum of its proper divisors (1145421696873).
3113021231223 is a wasteful number, since it uses less digits than its factorization.
3113021231223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38758914.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 3113021231223 its reverse (3221321203113), we get a palindrome (6334342434336).
The spelling of 3113021231223 in words is "three trillion, one hundred thirteen billion, twenty-one million, two hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •