Base | Representation |
---|---|
bin | 11000010011110100… |
… | …01000110000010001 |
3 | 1020200120000110021222 |
4 | 30021322020300101 |
5 | 203212042341131 |
6 | 5555015054425 |
7 | 641263556135 |
oct | 141172106021 |
9 | 36616013258 |
10 | 13051137041 |
11 | 5598032478 |
12 | 2642971415 |
13 | 12ccb677c7 |
14 | 8bb47b3c5 |
15 | 515ba387b |
hex | 309e88c11 |
13051137041 has 2 divisors, whose sum is σ = 13051137042. Its totient is φ = 13051137040.
The previous prime is 13051137037. The next prime is 13051137053. The reversal of 13051137041 is 14073115031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10505430016 + 2545707025 = 102496^2 + 50455^2 .
It is a cyclic number.
It is not a de Polignac number, because 13051137041 - 22 = 13051137037 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13051137041.
It is not a weakly prime, because it can be changed into another prime (13051130041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6525568520 + 6525568521.
It is an arithmetic number, because the mean of its divisors is an integer number (6525568521).
Almost surely, 213051137041 is an apocalyptic number.
It is an amenable number.
13051137041 is a deficient number, since it is larger than the sum of its proper divisors (1).
13051137041 is an equidigital number, since it uses as much as digits as its factorization.
13051137041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 26.
The spelling of 13051137041 in words is "thirteen billion, fifty-one million, one hundred thirty-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •