Base | Representation |
---|---|
bin | 1011001110011000… |
… | …0100011001001101 |
3 | 21202222200101201021 |
4 | 2303212010121031 |
5 | 22132323214013 |
6 | 1214553114141 |
7 | 134444636260 |
oct | 26346043115 |
9 | 7688611637 |
10 | 3013101133 |
11 | 13068a9529 |
12 | 7010b8951 |
13 | 3903207a3 |
14 | 208256cd7 |
15 | 1297d0a8d |
hex | b398464d |
3013101133 has 4 divisors (see below), whose sum is σ = 3443544160. Its totient is φ = 2582658108.
The previous prime is 3013101107. The next prime is 3013101173. The reversal of 3013101133 is 3311013103.
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, and also an emirpimes, since its reverse is a distinct semiprime: 3311013103 = 109 ⋅30376267.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3013101133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3013101103) 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, 215221503 + ... + 215221516.
It is an arithmetic number, because the mean of its divisors is an integer number (860886040).
Almost surely, 23013101133 is an apocalyptic number.
It is an amenable number.
3013101133 is a deficient number, since it is larger than the sum of its proper divisors (430443027).
3013101133 is an equidigital number, since it uses as much as digits as its factorization.
3013101133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430443026.
The product of its (nonzero) digits is 81, while the sum is 16.
The square root of 3013101133 is about 54891.7218986616. The cubic root of 3013101133 is about 1444.3459774992.
Adding to 3013101133 its reverse (3311013103), we get a palindrome (6324114236).
The spelling of 3013101133 in words is "three billion, thirteen million, one hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •