Base | Representation |
---|---|
bin | 101101100100110110001… |
… | …1011001011100001011101 |
3 | 211011211011122220200021001 |
4 | 1123021230123023201131 |
5 | 1310111412113210411 |
6 | 21153330512510301 |
7 | 1214356551152266 |
oct | 133115433134135 |
9 | 24154148820231 |
10 | 6263881381981 |
11 | 1aa5551817413 |
12 | 851b9524b391 |
13 | 3658b2298982 |
14 | 17926003b96d |
15 | ace107a3dc1 |
hex | 5b26c6cb85d |
6263881381981 has 2 divisors, whose sum is σ = 6263881381982. Its totient is φ = 6263881381980.
The previous prime is 6263881381897. The next prime is 6263881382023. The reversal of 6263881381981 is 1891831883626.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5816253479481 + 447627902500 = 2411691^2 + 669050^2 .
It is a cyclic number.
It is not a de Polignac number, because 6263881381981 - 219 = 6263880857693 is a prime.
It is a super-2 number, since 2×62638813819812 (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 (6263881381481) 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, 3131940690990 + 3131940690991.
It is an arithmetic number, because the mean of its divisors is an integer number (3131940690991).
Almost surely, 26263881381981 is an apocalyptic number.
It is an amenable number.
6263881381981 is a deficient number, since it is larger than the sum of its proper divisors (1).
6263881381981 is an equidigital number, since it uses as much as digits as its factorization.
6263881381981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 23887872, while the sum is 64.
The spelling of 6263881381981 in words is "six trillion, two hundred sixty-three billion, eight hundred eighty-one million, three hundred eighty-one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •