Base | Representation |
---|---|
bin | 1011100011010111… |
… | …1000100101000001 |
3 | 22000010022212220021 |
4 | 2320311320211001 |
5 | 22322342224441 |
6 | 1231420013441 |
7 | 136564124302 |
oct | 27065704501 |
9 | 8003285807 |
10 | 3101133121 |
11 | 1351566239 |
12 | 726691281 |
13 | 3a5633a18 |
14 | 215c107a9 |
15 | 1323be3d1 |
hex | b8d78941 |
3101133121 has 4 divisors (see below), whose sum is σ = 3102491392. Its totient is φ = 3099774852.
The previous prime is 3101133107. The next prime is 3101133131. The reversal of 3101133121 is 1213311013.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3101133121 - 211 = 3101131073 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3101133095 and 3101133104.
It is not an unprimeable number, because it can be changed into a prime (3101133131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 675705 + ... + 680278.
It is an arithmetic number, because the mean of its divisors is an integer number (775622848).
Almost surely, 23101133121 is an apocalyptic number.
It is an amenable number.
3101133121 is a deficient number, since it is larger than the sum of its proper divisors (1358271).
3101133121 is a wasteful number, since it uses less digits than its factorization.
3101133121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1358270.
The product of its (nonzero) digits is 54, while the sum is 16.
The square root of 3101133121 is about 55687.8184255767. The cubic root of 3101133121 is about 1458.2773704682.
Adding to 3101133121 its reverse (1213311013), we get a palindrome (4314444134).
The spelling of 3101133121 in words is "three billion, one hundred one million, one hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •