Base | Representation |
---|---|
bin | 10101110111101110… |
… | …10011001011000001 |
3 | 1010022022012201222102 |
4 | 22323313103023001 |
5 | 143021343123213 |
6 | 5221042520145 |
7 | 563654254601 |
oct | 127367231301 |
9 | 33268181872 |
10 | 11741770433 |
11 | 4a85a17a08 |
12 | 2338366055 |
13 | 1151800373 |
14 | 7d55dcc01 |
15 | 48ac63158 |
hex | 2bbdd32c1 |
11741770433 has 2 divisors, whose sum is σ = 11741770434. Its totient is φ = 11741770432.
The previous prime is 11741770427. The next prime is 11741770489. The reversal of 11741770433 is 33407714711.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11622349249 + 119421184 = 107807^2 + 10928^2 .
It is a cyclic number.
It is not a de Polignac number, because 11741770433 - 28 = 11741770177 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11741770493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5870885216 + 5870885217.
It is an arithmetic number, because the mean of its divisors is an integer number (5870885217).
Almost surely, 211741770433 is an apocalyptic number.
It is an amenable number.
11741770433 is a deficient number, since it is larger than the sum of its proper divisors (1).
11741770433 is an equidigital number, since it uses as much as digits as its factorization.
11741770433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 49392, while the sum is 38.
The spelling of 11741770433 in words is "eleven billion, seven hundred forty-one million, seven hundred seventy thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •