Base | Representation |
---|---|
bin | 101011011000… |
… | …011001111001 |
3 | 210101202122212 |
4 | 223120121321 |
5 | 10402402103 |
6 | 1043424505 |
7 | 165442652 |
oct | 53303171 |
9 | 23352585 |
10 | 11372153 |
11 | 6468081 |
12 | 3985135 |
13 | 24822b0 |
14 | 1720529 |
15 | ee97d8 |
hex | ad8679 |
11372153 has 8 divisors (see below), whose sum is σ = 12385800. Its totient is φ = 10378368.
The previous prime is 11372131. The next prime is 11372161. The reversal of 11372153 is 35127311.
It can be written as a sum of positive squares in 4 ways, for example, as 822649 + 10549504 = 907^2 + 3248^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11372153 - 212 = 11368057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11372173) 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, 3758 + ... + 6071.
It is an arithmetic number, because the mean of its divisors is an integer number (1548225).
Almost surely, 211372153 is an apocalyptic number.
11372153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11372153 is a deficient number, since it is larger than the sum of its proper divisors (1013647).
11372153 is an equidigital number, since it uses as much as digits as its factorization.
11372153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9931.
The product of its digits is 630, while the sum is 23.
The square root of 11372153 is about 3372.2622970344. The cubic root of 11372153 is about 224.8783078567.
Adding to 11372153 its reverse (35127311), we get a palindrome (46499464).
The spelling of 11372153 in words is "eleven million, three hundred seventy-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •