Base | Representation |
---|---|
bin | 101101011100101001110… |
… | …101111101001000010101 |
3 | 102001120101012222201111012 |
4 | 231130221311331020111 |
5 | 402132144131442234 |
6 | 10350430250222005 |
7 | 441432254322155 |
oct | 55345165751025 |
9 | 12046335881435 |
10 | 3123143234069 |
11 | aa4576a32101 |
12 | 425352424905 |
13 | 198684c9bb91 |
14 | ab23788c765 |
15 | 563906330ce |
hex | 2d729d7d215 |
3123143234069 has 2 divisors, whose sum is σ = 3123143234070. Its totient is φ = 3123143234068.
The previous prime is 3123143234051. The next prime is 3123143234111. The reversal of 3123143234069 is 9604323413213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1669341520900 + 1453801713169 = 1292030^2 + 1205737^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3123143234069 is a prime.
It is a super-2 number, since 2×31231432340692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3123143234009) 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, 1561571617034 + 1561571617035.
It is an arithmetic number, because the mean of its divisors is an integer number (1561571617035).
Almost surely, 23123143234069 is an apocalyptic number.
It is an amenable number.
3123143234069 is a deficient number, since it is larger than the sum of its proper divisors (1).
3123143234069 is an equidigital number, since it uses as much as digits as its factorization.
3123143234069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 279936, while the sum is 41.
The spelling of 3123143234069 in words is "three trillion, one hundred twenty-three billion, one hundred forty-three million, two hundred thirty-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •