Base | Representation |
---|---|
bin | 1011010101000101… |
… | …0101011000010001 |
3 | 21211221120222200222 |
4 | 2311101111120101 |
5 | 22212023020423 |
6 | 1221435522425 |
7 | 135235641641 |
oct | 26521253021 |
9 | 7757528628 |
10 | 3041220113 |
11 | 1320764758 |
12 | 70a5b9415 |
13 | 3960b7539 |
14 | 20bc96521 |
15 | 12bed73c8 |
hex | b5455611 |
3041220113 has 2 divisors, whose sum is σ = 3041220114. Its totient is φ = 3041220112.
The previous prime is 3041220097. The next prime is 3041220131. The reversal of 3041220113 is 3110221403.
Together with next prime (3041220131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1623848209 + 1417371904 = 40297^2 + 37648^2 .
It is a cyclic number.
It is not a de Polignac number, because 3041220113 - 24 = 3041220097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3041220091 and 3041220100.
It is not a weakly prime, because it can be changed into another prime (3041220913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1520610056 + 1520610057.
It is an arithmetic number, because the mean of its divisors is an integer number (1520610057).
Almost surely, 23041220113 is an apocalyptic number.
It is an amenable number.
3041220113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3041220113 is an equidigital number, since it uses as much as digits as its factorization.
3041220113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 3041220113 is about 55147.2584359368. The cubic root of 3041220113 is about 1448.8250669183.
Adding to 3041220113 its reverse (3110221403), we get a palindrome (6151441516).
The spelling of 3041220113 in words is "three billion, forty-one million, two hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •