Base | Representation |
---|---|
bin | 1011100011010111… |
… | …1000101010101001 |
3 | 22000010022220101121 |
4 | 2320311320222221 |
5 | 22322342232411 |
6 | 1231420015241 |
7 | 136564125325 |
oct | 27065705251 |
9 | 8003286347 |
10 | 3101133481 |
11 | 1351566536 |
12 | 726691521 |
13 | 3a5633c34 |
14 | 215c10985 |
15 | 1323be571 |
hex | b8d78aa9 |
3101133481 has 2 divisors, whose sum is σ = 3101133482. Its totient is φ = 3101133480.
The previous prime is 3101133449. The next prime is 3101133569. The reversal of 3101133481 is 1843311013.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2959904025 + 141229456 = 54405^2 + 11884^2 .
It is a cyclic number.
It is not a de Polignac number, because 3101133481 - 25 = 3101133449 is a prime.
It is a super-2 number, since 2×31011334812 = 19234057733958354722, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3101133181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1550566740 + 1550566741.
It is an arithmetic number, because the mean of its divisors is an integer number (1550566741).
Almost surely, 23101133481 is an apocalyptic number.
It is an amenable number.
3101133481 is a deficient number, since it is larger than the sum of its proper divisors (1).
3101133481 is an equidigital number, since it uses as much as digits as its factorization.
3101133481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 25.
The square root of 3101133481 is about 55687.8216578814. The cubic root of 3101133481 is about 1458.2774268970.
Adding to 3101133481 its reverse (1843311013), we get a palindrome (4944444494).
The spelling of 3101133481 in words is "three billion, one hundred one million, one hundred thirty-three thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •