Base | Representation |
---|---|
bin | 110101000101110001111… |
… | …011111101000001001101 |
3 | 110220210000000001120211121 |
4 | 311011301323331001031 |
5 | 434233244211314031 |
6 | 11432005041320541 |
7 | 524404143632443 |
oct | 65056173750115 |
9 | 13823000046747 |
10 | 3648338776141 |
11 | 1187285144244 |
12 | 4ab0a5336151 |
13 | 206063009317 |
14 | c881addab93 |
15 | 64d7d1b2011 |
hex | 35171efd04d |
3648338776141 has 2 divisors, whose sum is σ = 3648338776142. Its totient is φ = 3648338776140.
The previous prime is 3648338776109. The next prime is 3648338776169. The reversal of 3648338776141 is 1416778338463.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3113142648100 + 535196128041 = 1764410^2 + 731571^2 .
It is a cyclic number.
It is not a de Polignac number, because 3648338776141 - 25 = 3648338776109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3648338776141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3648338776171) 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, 1824169388070 + 1824169388071.
It is an arithmetic number, because the mean of its divisors is an integer number (1824169388071).
Almost surely, 23648338776141 is an apocalyptic number.
It is an amenable number.
3648338776141 is a deficient number, since it is larger than the sum of its proper divisors (1).
3648338776141 is an equidigital number, since it uses as much as digits as its factorization.
3648338776141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 48771072, while the sum is 61.
The spelling of 3648338776141 in words is "three trillion, six hundred forty-eight billion, three hundred thirty-eight million, seven hundred seventy-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •