Base | Representation |
---|---|
bin | 10101000100010001… |
… | …10011100111001111 |
3 | 1002012020001020222211 |
4 | 22202020303213033 |
5 | 141130344332033 |
6 | 5110143451251 |
7 | 550163464333 |
oct | 124210634717 |
9 | 32166036884 |
10 | 11310152143 |
11 | 4884316784 |
12 | 22378b6b27 |
13 | 10b326b324 |
14 | 7941677c3 |
15 | 462e062cd |
hex | 2a22339cf |
11310152143 has 8 divisors (see below), whose sum is σ = 11472500016. Its totient is φ = 11148004800.
The previous prime is 11310152111. The next prime is 11310152153. The reversal of 11310152143 is 34125101311.
It is a happy number.
11310152143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11310152143 - 25 = 11310152111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11310152153) 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 7 ways as a sum of consecutive naturals, for example, 65373 + ... + 163993.
It is an arithmetic number, because the mean of its divisors is an integer number (1434062502).
Almost surely, 211310152143 is an apocalyptic number.
11310152143 is a deficient number, since it is larger than the sum of its proper divisors (162347873).
11310152143 is an equidigital number, since it uses as much as digits as its factorization.
11310152143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100265.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 11310152143 its reverse (34125101311), we get a palindrome (45435253454).
The spelling of 11310152143 in words is "eleven billion, three hundred ten million, one hundred fifty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •