Base | Representation |
---|---|
bin | 101010001101… |
… | …000001111111 |
3 | 202211002011102 |
4 | 222031001333 |
5 | 10313012143 |
6 | 1033043315 |
7 | 163015610 |
oct | 52150177 |
9 | 22732142 |
10 | 11063423 |
11 | 6277128 |
12 | 385653b |
13 | 23a4907 |
14 | 167dc07 |
15 | e880b8 |
hex | a8d07f |
11063423 has 4 divisors (see below), whose sum is σ = 12643920. Its totient is φ = 9482928.
The previous prime is 11063419. The next prime is 11063431. The reversal of 11063423 is 32436011.
11063423 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 11063423 - 22 = 11063419 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11063395 and 11063404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11063443) 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 3 ways as a sum of consecutive naturals, for example, 790238 + ... + 790251.
It is an arithmetic number, because the mean of its divisors is an integer number (3160980).
Almost surely, 211063423 is an apocalyptic number.
11063423 is a deficient number, since it is larger than the sum of its proper divisors (1580497).
11063423 is an equidigital number, since it uses as much as digits as its factorization.
11063423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1580496.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 11063423 is about 3326.1724248752. The cubic root of 11063423 is about 222.8246189544.
Adding to 11063423 its reverse (32436011), we get a palindrome (43499434).
The spelling of 11063423 in words is "eleven million, sixty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •