Base | Representation |
---|---|
bin | 1100010001101100… |
… | …1111000111010011 |
3 | 22111200000102122110 |
4 | 3010123033013103 |
5 | 23222120133011 |
6 | 1303001240403 |
7 | 144444032205 |
oct | 30433170723 |
9 | 8450012573 |
10 | 3295474131 |
11 | 1441233544 |
12 | 77b793103 |
13 | 4069892c1 |
14 | 23395c775 |
15 | 1444abba6 |
hex | c46cf1d3 |
3295474131 has 8 divisors (see below), whose sum is σ = 4545481680. Its totient is φ = 2121224672.
The previous prime is 3295474103. The next prime is 3295474141. The reversal of 3295474131 is 1314745923.
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 3295474131 - 26 = 3295474067 is a prime.
It is a super-2 number, since 2×32954741312 = 21720299496180410322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3295474131.
It is not an unprimeable number, because it can be changed into a prime (3295474141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18939420 + ... + 18939593.
It is an arithmetic number, because the mean of its divisors is an integer number (568185210).
Almost surely, 23295474131 is an apocalyptic number.
3295474131 is a deficient number, since it is larger than the sum of its proper divisors (1250007549).
3295474131 is a wasteful number, since it uses less digits than its factorization.
3295474131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37879045.
The product of its digits is 90720, while the sum is 39.
The square root of 3295474131 is about 57406.2203162689. The cubic root of 3295474131 is about 1488.1246214745.
The spelling of 3295474131 in words is "three billion, two hundred ninety-five million, four hundred seventy-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •