Base | Representation |
---|---|
bin | 1011111101011110000101… |
… | …0010001110010000001111 |
3 | 1201120012012010020102001111 |
4 | 2333113201102032100033 |
5 | 3210430040140344011 |
6 | 43545200402552451 |
7 | 2525050655161222 |
oct | 277274122162017 |
9 | 51505163212044 |
10 | 13150674543631 |
11 | 4210195a40519 |
12 | 1584832368727 |
13 | 745145c03101 |
14 | 3366d32055b9 |
15 | 17c12c5ab121 |
hex | bf5e148e40f |
13150674543631 has 2 divisors, whose sum is σ = 13150674543632. Its totient is φ = 13150674543630.
The previous prime is 13150674543557. The next prime is 13150674543647. The reversal of 13150674543631 is 13634547605131.
It is a strong prime.
It is an emirp because it is prime and its reverse (13634547605131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13150674543631 is a prime.
It is a super-3 number, since 3×131506745436313 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13150674543431) 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, 6575337271815 + 6575337271816.
It is an arithmetic number, because the mean of its divisors is an integer number (6575337271816).
Almost surely, 213150674543631 is an apocalyptic number.
13150674543631 is a deficient number, since it is larger than the sum of its proper divisors (1).
13150674543631 is an equidigital number, since it uses as much as digits as its factorization.
13150674543631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2721600, while the sum is 49.
The spelling of 13150674543631 in words is "thirteen trillion, one hundred fifty billion, six hundred seventy-four million, five hundred forty-three thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.040 sec. • engine limits •