Base | Representation |
---|---|
bin | 101011100101… |
… | …110100000011 |
3 | 210111120000000 |
4 | 223211310003 |
5 | 10411131300 |
6 | 1044531043 |
7 | 166062042 |
oct | 53456403 |
9 | 23446000 |
10 | 11427075 |
11 | 64a5370 |
12 | 39b0a83 |
13 | 24a12aa |
14 | 1736559 |
15 | 100ac00 |
hex | ae5d03 |
11427075 has 96 divisors (see below), whose sum is σ = 24403200. Its totient is φ = 5248800.
The previous prime is 11427071. The next prime is 11427089. The reversal of 11427075 is 57072411.
11427075 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11427075 - 22 = 11427071 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (11427071) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 601416 + ... + 601434.
It is an arithmetic number, because the mean of its divisors is an integer number (254200).
Almost surely, 211427075 is an apocalyptic number.
11427075 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11427075 is an abundant number, since it is smaller than the sum of its proper divisors (12976125).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11427075 is an equidigital number, since it uses as much as digits as its factorization.
11427075 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61 (or 38 counting only the distinct ones).
The product of its (nonzero) digits is 1960, while the sum is 27.
The square root of 11427075 is about 3380.3956868982. The cubic root of 11427075 is about 225.2397444541.
Adding to 11427075 its reverse (57072411), we get a palindrome (68499486).
The spelling of 11427075 in words is "eleven million, four hundred twenty-seven thousand, seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •