Base | Representation |
---|---|
bin | 10101010000100110… |
… | …01011101011001101 |
3 | 1002110102120200012201 |
4 | 22220103023223031 |
5 | 141333331113222 |
6 | 5124315401501 |
7 | 552560310343 |
oct | 125023135315 |
9 | 32412520181 |
10 | 11413535437 |
11 | 4927709117 |
12 | 2266453291 |
13 | 10cb7c7a85 |
14 | 7a3b99993 |
15 | 46c028427 |
hex | 2a84cbacd |
11413535437 has 2 divisors, whose sum is σ = 11413535438. Its totient is φ = 11413535436.
The previous prime is 11413535431. The next prime is 11413535449. The reversal of 11413535437 is 73453531411.
11413535437 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., 11394708516 + 18826921 = 106746^2 + 4339^2 .
It is a cyclic number.
It is not a de Polignac number, because 11413535437 - 223 = 11405146829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11413535396 and 11413535405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11413535431) 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, 5706767718 + 5706767719.
It is an arithmetic number, because the mean of its divisors is an integer number (5706767719).
Almost surely, 211413535437 is an apocalyptic number.
It is an amenable number.
11413535437 is a deficient number, since it is larger than the sum of its proper divisors (1).
11413535437 is an equidigital number, since it uses as much as digits as its factorization.
11413535437 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 75600, while the sum is 37.
The spelling of 11413535437 in words is "eleven billion, four hundred thirteen million, five hundred thirty-five thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •