Base | Representation |
---|---|
bin | 110001111011101100001… |
… | …100001111011010101101 |
3 | 110011000220102212120021221 |
4 | 301323230030033122231 |
5 | 422204344203042221 |
6 | 11144201104423341 |
7 | 502622652205165 |
oct | 61735414173255 |
9 | 13130812776257 |
10 | 3431346534061 |
11 | 1103253733076 |
12 | 475027017b51 |
13 | 1bb7614b1c44 |
14 | bc1142995a5 |
15 | 5e3cd099541 |
hex | 31eec30f6ad |
3431346534061 has 2 divisors, whose sum is σ = 3431346534062. Its totient is φ = 3431346534060.
The previous prime is 3431346533983. The next prime is 3431346534113. The reversal of 3431346534061 is 1604356431343.
3431346534061 is digitally balanced in base 3, 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., 3342977081161 + 88369452900 = 1828381^2 + 297270^2 .
It is a cyclic number.
It is not a de Polignac number, because 3431346534061 - 211 = 3431346532013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3431346533999 and 3431346534017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3431346535061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1715673267030 + 1715673267031.
It is an arithmetic number, because the mean of its divisors is an integer number (1715673267031).
Almost surely, 23431346534061 is an apocalyptic number.
It is an amenable number.
3431346534061 is a deficient number, since it is larger than the sum of its proper divisors (1).
3431346534061 is an equidigital number, since it uses as much as digits as its factorization.
3431346534061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 933120, while the sum is 43.
The spelling of 3431346534061 in words is "three trillion, four hundred thirty-one billion, three hundred forty-six million, five hundred thirty-four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •