Base | Representation |
---|---|
bin | 10101011111001000… |
… | …01110010011010001 |
3 | 1002202220222020011022 |
4 | 22233210032103101 |
5 | 142111033140103 |
6 | 5144352325225 |
7 | 555600435413 |
oct | 125744162321 |
9 | 32686866138 |
10 | 11535443153 |
11 | 498a5031a3 |
12 | 229b243815 |
13 | 111ab3c110 |
14 | 7b60509b3 |
15 | 477aa9138 |
hex | 2af90e4d1 |
11535443153 has 16 divisors (see below), whose sum is σ = 13143049920. Its totient is φ = 10036426176.
The previous prime is 11535443141. The next prime is 11535443159. The reversal of 11535443153 is 35134453511.
11535443153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11535443153 - 210 = 11535442129 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11535443159) 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 in 15 ways as a sum of consecutive naturals, for example, 69875 + ... + 167192.
It is an arithmetic number, because the mean of its divisors is an integer number (821440620).
Almost surely, 211535443153 is an apocalyptic number.
11535443153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11535443153 is a deficient number, since it is larger than the sum of its proper divisors (1607606767).
11535443153 is a wasteful number, since it uses less digits than its factorization.
11535443153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237296.
The product of its digits is 54000, while the sum is 35.
Adding to 11535443153 its reverse (35134453511), we get a palindrome (46669896664).
The spelling of 11535443153 in words is "eleven billion, five hundred thirty-five million, four hundred forty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •