Base | Representation |
---|---|
bin | 10101100001001111… |
… | …10010110101010001 |
3 | 1002211011022011012201 |
4 | 22300213302311101 |
5 | 142130102001213 |
6 | 5150224123201 |
7 | 556204131550 |
oct | 126047626521 |
9 | 32734264181 |
10 | 11553156433 |
11 | 4999501475 |
12 | 22a5166501 |
13 | 1121701750 |
14 | 7b8541d97 |
15 | 4794076dd |
hex | 2b09f2d51 |
11553156433 has 32 divisors (see below), whose sum is σ = 14628547584. Its totient is φ = 8880717312.
The previous prime is 11553156413. The next prime is 11553156437. The reversal of 11553156433 is 33465135511.
11553156433 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 11553156433 - 217 = 11553025361 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11553156392 and 11553156401.
It is not an unprimeable number, because it can be changed into a prime (11553156437) 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 31 ways as a sum of consecutive naturals, for example, 576091 + ... + 595807.
It is an arithmetic number, because the mean of its divisors is an integer number (457142112).
Almost surely, 211553156433 is an apocalyptic number.
11553156433 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11553156433 is a deficient number, since it is larger than the sum of its proper divisors (3075391151).
11553156433 is a wasteful number, since it uses less digits than its factorization.
11553156433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19921.
The product of its digits is 81000, while the sum is 37.
The spelling of 11553156433 in words is "eleven billion, five hundred fifty-three million, one hundred fifty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •