Base | Representation |
---|---|
bin | 10101101000010100… |
… | …11100010100111101 |
3 | 1002222022002201121001 |
4 | 22310022130110331 |
5 | 142240304232231 |
6 | 5200145410301 |
7 | 560525136646 |
oct | 126412342475 |
9 | 32868081531 |
10 | 11612570941 |
11 | 4a19aa2474 |
12 | 2301039991 |
13 | 1130b0506a |
14 | 7c23aa6cd |
15 | 47e741b61 |
hex | 2b429c53d |
11612570941 has 2 divisors, whose sum is σ = 11612570942. Its totient is φ = 11612570940.
The previous prime is 11612570929. The next prime is 11612570969. The reversal of 11612570941 is 14907521611.
11612570941 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11528316900 + 84254041 = 107370^2 + 9179^2 .
It is a cyclic number.
It is not a de Polignac number, because 11612570941 - 25 = 11612570909 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11612570941.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11612570971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5806285470 + 5806285471.
It is an arithmetic number, because the mean of its divisors is an integer number (5806285471).
Almost surely, 211612570941 is an apocalyptic number.
It is an amenable number.
11612570941 is a deficient number, since it is larger than the sum of its proper divisors (1).
11612570941 is an equidigital number, since it uses as much as digits as its factorization.
11612570941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 37.
The spelling of 11612570941 in words is "eleven billion, six hundred twelve million, five hundred seventy thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •