Base | Representation |
---|---|
bin | 101101011100111010101… |
… | …101010000001010111101 |
3 | 102001121002221101010100202 |
4 | 231130322231100022331 |
5 | 402133234044243222 |
6 | 10350514314333245 |
7 | 441442261232024 |
oct | 55347255201275 |
9 | 12047087333322 |
10 | 3123426165437 |
11 | aa4701708686 |
12 | 42541112a225 |
13 | 1986cb7a18a6 |
14 | ab26329b8bb |
15 | 563aa3be892 |
hex | 2d73ab502bd |
3123426165437 has 2 divisors, whose sum is σ = 3123426165438. Its totient is φ = 3123426165436.
The previous prime is 3123426165403. The next prime is 3123426165469. The reversal of 3123426165437 is 7345616243213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1976355177241 + 1147070988196 = 1405829^2 + 1071014^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3123426165437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3123426165391 and 3123426165400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3123426167437) 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, 1561713082718 + 1561713082719.
It is an arithmetic number, because the mean of its divisors is an integer number (1561713082719).
Almost surely, 23123426165437 is an apocalyptic number.
It is an amenable number.
3123426165437 is a deficient number, since it is larger than the sum of its proper divisors (1).
3123426165437 is an equidigital number, since it uses as much as digits as its factorization.
3123426165437 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2177280, while the sum is 47.
The spelling of 3123426165437 in words is "three trillion, one hundred twenty-three billion, four hundred twenty-six million, one hundred sixty-five thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •