Base | Representation |
---|---|
bin | 101111000001011000101… |
… | …011101001001011010001 |
3 | 102102220120002010102212111 |
4 | 233001120223221023101 |
5 | 410420202112224244 |
6 | 10512235030425321 |
7 | 452311464243442 |
oct | 57013053511321 |
9 | 12386502112774 |
10 | 3231303242449 |
11 | 103642a493287 |
12 | 4422b8b02241 |
13 | 1a5931215c39 |
14 | b25785492c9 |
15 | 590c0e22e34 |
hex | 2f058ae92d1 |
3231303242449 has 2 divisors, whose sum is σ = 3231303242450. Its totient is φ = 3231303242448.
The previous prime is 3231303242413. The next prime is 3231303242501. The reversal of 3231303242449 is 9442423031323.
3231303242449 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2188423166224 + 1042880076225 = 1479332^2 + 1021215^2 .
It is a cyclic number.
It is not a de Polignac number, because 3231303242449 - 229 = 3230766371537 is a prime.
It is a super-2 number, since 2×32313032424492 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3231303242749) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1615651621224 + 1615651621225.
It is an arithmetic number, because the mean of its divisors is an integer number (1615651621225).
Almost surely, 23231303242449 is an apocalyptic number.
It is an amenable number.
3231303242449 is a deficient number, since it is larger than the sum of its proper divisors (1).
3231303242449 is an equidigital number, since it uses as much as digits as its factorization.
3231303242449 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 373248, while the sum is 40.
The spelling of 3231303242449 in words is "three trillion, two hundred thirty-one billion, three hundred three million, two hundred forty-two thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •