Base | Representation |
---|---|
bin | 1011010001011101… |
… | …0010110000101001 |
3 | 21210212221222112111 |
4 | 2310113102300221 |
5 | 22144124130113 |
6 | 1220133442321 |
7 | 134662422052 |
oct | 26427226051 |
9 | 7725858474 |
10 | 3026005033 |
11 | 1313112407 |
12 | 7054a03a1 |
13 | 392bbb02c |
14 | 209c55729 |
15 | 12a9ce13d |
hex | b45d2c29 |
3026005033 has 4 divisors (see below), whose sum is σ = 3026250180. Its totient is φ = 3025759888.
The previous prime is 3026005001. The next prime is 3026005067. The reversal of 3026005033 is 3305006203.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3305006203 = 331 ⋅9984913.
It can be written as a sum of positive squares in 2 ways, for example, as 1302343744 + 1723661289 = 36088^2 + 41517^2 .
It is a cyclic number.
It is not a de Polignac number, because 3026005033 - 25 = 3026005001 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3026004995 and 3026005013.
It is not an unprimeable number, because it can be changed into a prime (3026005093) 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, 103018 + ... + 129091.
It is an arithmetic number, because the mean of its divisors is an integer number (756562545).
Almost surely, 23026005033 is an apocalyptic number.
It is an amenable number.
3026005033 is a deficient number, since it is larger than the sum of its proper divisors (245147).
3026005033 is a wasteful number, since it uses less digits than its factorization.
3026005033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245146.
The product of its (nonzero) digits is 1620, while the sum is 22.
The square root of 3026005033 is about 55009.1359048658. The cubic root of 3026005033 is about 1446.4048920461.
The spelling of 3026005033 in words is "three billion, twenty-six million, five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •