Base | Representation |
---|---|
bin | 101100100010111111101… |
… | …100010000100011010101 |
3 | 101211122120120112001001112 |
4 | 230202333230100203111 |
5 | 400123401041441031 |
6 | 10302151054104405 |
7 | 434111126113205 |
oct | 54427754204325 |
9 | 11748516461045 |
10 | 3061232765141 |
11 | a802970a9501 |
12 | 4153547ab105 |
13 | 1928997b4005 |
14 | a82433a8405 |
15 | 5496a30562b |
hex | 2c8bfb108d5 |
3061232765141 has 2 divisors, whose sum is σ = 3061232765142. Its totient is φ = 3061232765140.
The previous prime is 3061232765137. The next prime is 3061232765153. The reversal of 3061232765141 is 1415672321603.
3061232765141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1532819801041 + 1528412964100 = 1238071^2 + 1236290^2 .
It is a cyclic number.
It is not a de Polignac number, because 3061232765141 - 22 = 3061232765137 is a prime.
It is a super-2 number, since 2×30612327651412 (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 (3061232765161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1530616382570 + 1530616382571.
It is an arithmetic number, because the mean of its divisors is an integer number (1530616382571).
Almost surely, 23061232765141 is an apocalyptic number.
It is an amenable number.
3061232765141 is a deficient number, since it is larger than the sum of its proper divisors (1).
3061232765141 is an equidigital number, since it uses as much as digits as its factorization.
3061232765141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 181440, while the sum is 41.
The spelling of 3061232765141 in words is "three trillion, sixty-one billion, two hundred thirty-two million, seven hundred sixty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •