Base | Representation |
---|---|
bin | 1011101100101011… |
… | …1111010111111101 |
3 | 22002211212201120202 |
4 | 2323022333113331 |
5 | 22412344023123 |
6 | 1235333453245 |
7 | 140550301361 |
oct | 27312772775 |
9 | 8084781522 |
10 | 3140220413 |
11 | 1371633090 |
12 | 7377a1225 |
13 | 3b076acb5 |
14 | 21b0a72a1 |
15 | 135a40a28 |
hex | bb2bf5fd |
3140220413 has 8 divisors (see below), whose sum is σ = 3427306176. Its totient is φ = 2853403200.
The previous prime is 3140220409. The next prime is 3140220439.
3140220413 is nontrivially palindromic in base 10.
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 3140220413 - 22 = 3140220409 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3140220443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42281 + ... + 89822.
It is an arithmetic number, because the mean of its divisors is an integer number (428413272).
Almost surely, 23140220413 is an apocalyptic number.
It is an amenable number.
3140220413 is a deficient number, since it is larger than the sum of its proper divisors (287085763).
3140220413 is a wasteful number, since it uses less digits than its factorization.
3140220413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134275.
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 3140220413 is about 56037.6695893039. The cubic root of 3140220413 is about 1464.3786130275.
It can be divided in two parts, 31402 and 20413, that added together give a palindrome (51815).
The spelling of 3140220413 in words is "three billion, one hundred forty million, two hundred twenty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •