Base | Representation |
---|---|
bin | 101111001100101010100… |
… | …110110011010001101011 |
3 | 102111001211011202201112221 |
4 | 233030222212303101223 |
5 | 411120003232414201 |
6 | 10522000534214511 |
7 | 453220564443625 |
oct | 57145246632153 |
9 | 12431734681487 |
10 | 3243415123051 |
11 | 1040585310464 |
12 | 4447191b4437 |
13 | 1a6b115c0aac |
14 | b2da6d6bc15 |
15 | 5957e3e34a1 |
hex | 2f32a9b346b |
3243415123051 has 2 divisors, whose sum is σ = 3243415123052. Its totient is φ = 3243415123050.
The previous prime is 3243415123027. The next prime is 3243415123063. The reversal of 3243415123051 is 1503215143423.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3243415123051 - 213 = 3243415114859 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3243415122998 and 3243415123016.
It is not a weakly prime, because it can be changed into another prime (3243415103051) 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 as a sum of consecutive naturals, namely, 1621707561525 + 1621707561526.
It is an arithmetic number, because the mean of its divisors is an integer number (1621707561526).
Almost surely, 23243415123051 is an apocalyptic number.
3243415123051 is a deficient number, since it is larger than the sum of its proper divisors (1).
3243415123051 is an equidigital number, since it uses as much as digits as its factorization.
3243415123051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 34.
The spelling of 3243415123051 in words is "three trillion, two hundred forty-three billion, four hundred fifteen million, one hundred twenty-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •