Base | Representation |
---|---|
bin | 1011010011000000… |
… | …0010001001110101 |
3 | 21211100011111002011 |
4 | 2310300002021311 |
5 | 22202304144423 |
6 | 1220524444221 |
7 | 135101513335 |
oct | 26460021165 |
9 | 7740144064 |
10 | 3032490613 |
11 | 1316842099 |
12 | 7076a9671 |
13 | 39434c059 |
14 | 20aa630c5 |
15 | 12b360b0d |
hex | b4c02275 |
3032490613 has 8 divisors (see below), whose sum is σ = 3038881880. Its totient is φ = 3026108160.
The previous prime is 3032490607. The next prime is 3032490641. The reversal of 3032490613 is 3160942303.
It can be written as a sum of positive squares in 4 ways, for example, as 115734564 + 2916756049 = 10758^2 + 54007^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3032490613 - 221 = 3030393461 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3032490653) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1829281 + ... + 1830937.
It is an arithmetic number, because the mean of its divisors is an integer number (379860235).
Almost surely, 23032490613 is an apocalyptic number.
It is an amenable number.
3032490613 is a deficient number, since it is larger than the sum of its proper divisors (6391267).
3032490613 is a wasteful number, since it uses less digits than its factorization.
3032490613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4407.
The product of its (nonzero) digits is 11664, while the sum is 31.
The square root of 3032490613 is about 55068.0543781964. The cubic root of 3032490613 is about 1447.4375055224.
The spelling of 3032490613 in words is "three billion, thirty-two million, four hundred ninety thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.389 sec. • engine limits •