Base | Representation |
---|---|
bin | 1011111000010111101001… |
… | …1111001111001011110111 |
3 | 1201020211000110020122100212 |
4 | 2332011322133033023313 |
5 | 3203011111420244101 |
6 | 43441025500500035 |
7 | 2515526366443661 |
oct | 276057237171367 |
9 | 51224013218325 |
10 | 13063050556151 |
11 | 4187010538842 |
12 | 156b85924a61b |
13 | 739ac041b3cb |
14 | 33237dac1531 |
15 | 179beeb181bb |
hex | be17a7cf2f7 |
13063050556151 has 2 divisors, whose sum is σ = 13063050556152. Its totient is φ = 13063050556150.
The previous prime is 13063050556109. The next prime is 13063050556223. The reversal of 13063050556151 is 15165505036031.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13063050556151 - 214 = 13063050539767 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13063050556099 and 13063050556108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13063050576151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6531525278075 + 6531525278076.
It is an arithmetic number, because the mean of its divisors is an integer number (6531525278076).
Almost surely, 213063050556151 is an apocalyptic number.
13063050556151 is a deficient number, since it is larger than the sum of its proper divisors (1).
13063050556151 is an equidigital number, since it uses as much as digits as its factorization.
13063050556151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 202500, while the sum is 41.
The spelling of 13063050556151 in words is "thirteen trillion, sixty-three billion, fifty million, five hundred fifty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •