Base | Representation |
---|---|
bin | 1011010000100001… |
… | …1100100101011001 |
3 | 21210121122020211022 |
4 | 2310020130211121 |
5 | 22142130104423 |
6 | 1215514212225 |
7 | 134614352255 |
oct | 26410344531 |
9 | 7717566738 |
10 | 3022113113 |
11 | 13109a4348 |
12 | 704124075 |
13 | 392157716 |
14 | 209521265 |
15 | 12a4b0dc8 |
hex | b421c959 |
3022113113 has 8 divisors (see below), whose sum is σ = 3192842880. Its totient is φ = 2855818000.
The previous prime is 3022113097. The next prime is 3022113187. The reversal of 3022113113 is 3113112203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3022113113 - 24 = 3022113097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3022113091 and 3022113100.
It is not an unprimeable number, because it can be changed into a prime (3022112113) 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, 1107263 + ... + 1109988.
It is an arithmetic number, because the mean of its divisors is an integer number (399105360).
Almost surely, 23022113113 is an apocalyptic number.
It is an amenable number.
3022113113 is a deficient number, since it is larger than the sum of its proper divisors (170729767).
3022113113 is a wasteful number, since it uses less digits than its factorization.
3022113113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2217327.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 3022113113 is about 54973.7493081925. The cubic root of 3022113113 is about 1445.7845243580.
Adding to 3022113113 its reverse (3113112203), we get a palindrome (6135225316).
It can be divided in two parts, 30221 and 13113, that added together give a palindrome (43334).
The spelling of 3022113113 in words is "three billion, twenty-two million, one hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •