Base | Representation |
---|---|
bin | 101101100101110100011… |
… | …001011110000000011101 |
3 | 102002111210001010001001002 |
4 | 231211310121132000131 |
5 | 402312322400223344 |
6 | 10355134544000045 |
7 | 442231156353431 |
oct | 55456431360035 |
9 | 12074701101032 |
10 | 3132983992349 |
11 | aa8766872492 |
12 | 42723a000025 |
13 | 1995929a2a83 |
14 | ab8cc7dc9c1 |
15 | 5676953844e |
hex | 2d97465e01d |
3132983992349 has 2 divisors, whose sum is σ = 3132983992350. Its totient is φ = 3132983992348.
The previous prime is 3132983992309. The next prime is 3132983992351. The reversal of 3132983992349 is 9432993892313.
3132983992349 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1613725605625 + 1519258386724 = 1270325^2 + 1232582^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3132983992349 is a prime.
Together with 3132983992351, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3132983992309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1566491996174 + 1566491996175.
It is an arithmetic number, because the mean of its divisors is an integer number (1566491996175).
Almost surely, 23132983992349 is an apocalyptic number.
It is an amenable number.
3132983992349 is a deficient number, since it is larger than the sum of its proper divisors (1).
3132983992349 is an equidigital number, since it uses as much as digits as its factorization.
3132983992349 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 68024448, while the sum is 65.
The spelling of 3132983992349 in words is "three trillion, one hundred thirty-two billion, nine hundred eighty-three million, nine hundred ninety-two thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •