Base | Representation |
---|---|
bin | 10101001011001010… |
… | …00011110011101001 |
3 | 1002100020200122122122 |
4 | 22211211003303221 |
5 | 141240134441103 |
6 | 5120005201025 |
7 | 551464320614 |
oct | 124545036351 |
9 | 32306618578 |
10 | 11367890153 |
11 | 4903972144 |
12 | 2253100175 |
13 | 10c2205829 |
14 | 79bab717b |
15 | 46800db38 |
hex | 2a5943ce9 |
11367890153 has 4 divisors (see below), whose sum is σ = 11368386900. Its totient is φ = 11367393408.
The previous prime is 11367890147. The next prime is 11367890161. The reversal of 11367890153 is 35109876311.
11367890153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6802455529 + 4565434624 = 82477^2 + 67568^2 .
It is a cyclic number.
It is not a de Polignac number, because 11367890153 - 24 = 11367890137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11367890173) 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 3 ways as a sum of consecutive naturals, for example, 212300 + ... + 260397.
It is an arithmetic number, because the mean of its divisors is an integer number (2842096725).
Almost surely, 211367890153 is an apocalyptic number.
It is an amenable number.
11367890153 is a deficient number, since it is larger than the sum of its proper divisors (496747).
11367890153 is an equidigital number, since it uses as much as digits as its factorization.
11367890153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 496746.
The product of its (nonzero) digits is 136080, while the sum is 44.
The spelling of 11367890153 in words is "eleven billion, three hundred sixty-seven million, eight hundred ninety thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •