Base | Representation |
---|---|
bin | 10101100000000011… |
… | …11101110111010111 |
3 | 1002210110122100122000 |
4 | 22300001331313113 |
5 | 142120032141101 |
6 | 5145231410343 |
7 | 556023631242 |
oct | 126001756727 |
9 | 32713570560 |
10 | 11543240151 |
11 | 49939491a3 |
12 | 22a19839b3 |
13 | 111c63c021 |
14 | 7b70c0259 |
15 | 4785e9486 |
hex | 2b007ddd7 |
11543240151 has 8 divisors (see below), whose sum is σ = 17101096560. Its totient is φ = 7695493416.
The previous prime is 11543240117. The next prime is 11543240173. The reversal of 11543240151 is 15104234511.
It is not a de Polignac number, because 11543240151 - 233 = 2953305559 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 427527413 = 11543240151 / (1 + 1 + 5 + 4 + 3 + 2 + 4 + 0 + 1 + 5 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11543240251) 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 in 7 ways as a sum of consecutive naturals, for example, 213763680 + ... + 213763733.
It is an arithmetic number, because the mean of its divisors is an integer number (2137637070).
Almost surely, 211543240151 is an apocalyptic number.
11543240151 is a deficient number, since it is larger than the sum of its proper divisors (5557856409).
11543240151 is an equidigital number, since it uses as much as digits as its factorization.
11543240151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 427527422 (or 427527416 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 11543240151 its reverse (15104234511), we get a palindrome (26647474662).
The spelling of 11543240151 in words is "eleven billion, five hundred forty-three million, two hundred forty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •