Base | Representation |
---|---|
bin | 1100001001100010… |
… | …1110001001111101 |
3 | 22102021122012020201 |
4 | 3002120232021331 |
5 | 23134340313123 |
6 | 1255340043501 |
7 | 143550153565 |
oct | 30230561175 |
9 | 8367565221 |
10 | 3261260413 |
11 | 1423995244 |
12 | 770233591 |
13 | 3cc86a3b8 |
14 | 22d1b3da5 |
15 | 14149e5ad |
hex | c262e27d |
3261260413 has 8 divisors (see below), whose sum is σ = 3405650688. Its totient is φ = 3117086544.
The previous prime is 3261260371. The next prime is 3261260423. The reversal of 3261260413 is 3140621623.
3261260413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 3261260413 - 217 = 3261129341 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 (3261260423) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22906 + ... + 83947.
It is an arithmetic number, because the mean of its divisors is an integer number (425706336).
Almost surely, 23261260413 is an apocalyptic number.
It is an amenable number.
3261260413 is a deficient number, since it is larger than the sum of its proper divisors (144390275).
3261260413 is a wasteful number, since it uses less digits than its factorization.
3261260413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 108203.
The product of its (nonzero) digits is 5184, while the sum is 28.
The square root of 3261260413 is about 57107.4462132566. The cubic root of 3261260413 is about 1482.9567765898.
It can be divided in two parts, 32612 and 60413, that added together give a square (93025 = 3052).
The spelling of 3261260413 in words is "three billion, two hundred sixty-one million, two hundred sixty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •