Base | Representation |
---|---|
bin | 101101110001000011110… |
… | …110110110111101110101 |
3 | 102010122221020221010100211 |
4 | 231301003312312331311 |
5 | 403012032423440221 |
6 | 10404452413105421 |
7 | 443136245201644 |
oct | 55610366667565 |
9 | 12118836833324 |
10 | 3145054515061 |
11 | 10028a0311898 |
12 | 429648488271 |
13 | 19a767629cc4 |
14 | ac31593735b |
15 | 56c240896e1 |
hex | 2dc43db6f75 |
3145054515061 has 2 divisors, whose sum is σ = 3145054515062. Its totient is φ = 3145054515060.
The previous prime is 3145054514947. The next prime is 3145054515091. The reversal of 3145054515061 is 1605154505413.
3145054515061 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., 2721213152100 + 423841362961 = 1649610^2 + 651031^2 .
It is a cyclic number.
It is not a de Polignac number, because 3145054515061 - 219 = 3145053990773 is a prime.
It is a super-3 number, since 3×31450545150613 (a number of 38 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3145054515091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1572527257530 + 1572527257531.
It is an arithmetic number, because the mean of its divisors is an integer number (1572527257531).
Almost surely, 23145054515061 is an apocalyptic number.
It is an amenable number.
3145054515061 is a deficient number, since it is larger than the sum of its proper divisors (1).
3145054515061 is an equidigital number, since it uses as much as digits as its factorization.
3145054515061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 180000, while the sum is 40.
The spelling of 3145054515061 in words is "three trillion, one hundred forty-five billion, fifty-four million, five hundred fifteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •