Base | Representation |
---|---|
bin | 101100010111… |
… | …001001010111 |
3 | 210212211012000 |
4 | 230113021113 |
5 | 10434113033 |
6 | 1053130343 |
7 | 200563131 |
oct | 54271127 |
9 | 23784160 |
10 | 11629143 |
11 | 6623169 |
12 | 3a899b3 |
13 | 2542266 |
14 | 178a051 |
15 | 104aa13 |
hex | b17257 |
11629143 has 8 divisors (see below), whose sum is σ = 17228400. Its totient is φ = 7752744.
The previous prime is 11629141. The next prime is 11629151. The reversal of 11629143 is 34192611.
11629143 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11629143 - 21 = 11629141 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: 430709 = 11629143 / (1 + 1 + 6 + 2 + 9 + 1 + 4 + 3).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11629141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 215328 + ... + 215381.
It is an arithmetic number, because the mean of its divisors is an integer number (2153550).
Almost surely, 211629143 is an apocalyptic number.
11629143 is a deficient number, since it is larger than the sum of its proper divisors (5599257).
11629143 is an equidigital number, since it uses as much as digits as its factorization.
11629143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430718 (or 430712 counting only the distinct ones).
The product of its digits is 1296, while the sum is 27.
The square root of 11629143 is about 3410.1529291221. The cubic root of 11629143 is about 226.5596527236.
The spelling of 11629143 in words is "eleven million, six hundred twenty-nine thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •