Base | Representation |
---|---|
bin | 101101010011001110100… |
… | …101101111010111000001 |
3 | 102000121020212201010100020 |
4 | 231103032211233113001 |
5 | 402000432203301423 |
6 | 10342034104044053 |
7 | 440623411100214 |
oct | 55231645572701 |
9 | 12017225633306 |
10 | 3113022322113 |
11 | aa0252a43160 |
12 | 4233a8a63629 |
13 | 197731228692 |
14 | aa95765377b |
15 | 55e9bd3e4e3 |
hex | 2d4ce96f5c1 |
3113022322113 has 16 divisors (see below), whose sum is σ = 4528066461696. Its totient is φ = 1886666031440.
The previous prime is 3113022322079. The next prime is 3113022322141. The reversal of 3113022322113 is 3112232203113.
It is a cyclic number.
It is not a de Polignac number, because 3113022322113 - 26 = 3113022322049 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3113022322183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5605120 + ... + 6135422.
It is an arithmetic number, because the mean of its divisors is an integer number (283004153856).
Almost surely, 23113022322113 is an apocalyptic number.
3113022322113 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
3113022322113 is a deficient number, since it is larger than the sum of its proper divisors (1415044139583).
3113022322113 is a wasteful number, since it uses less digits than its factorization.
3113022322113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 708204.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 3113022322113 its reverse (3112232203113), we get a palindrome (6225254525226).
The spelling of 3113022322113 in words is "three trillion, one hundred thirteen billion, twenty-two million, three hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •