Base | Representation |
---|---|
bin | 101010000011… |
… | …111000110011 |
3 | 202202011210022 |
4 | 222003320303 |
5 | 10310312341 |
6 | 1032154055 |
7 | 162501455 |
oct | 52037063 |
9 | 22664708 |
10 | 11025971 |
11 | 6250a80 |
12 | 383892b |
13 | 2390858 |
14 | 16702d5 |
15 | e7be4b |
hex | a83e33 |
11025971 has 4 divisors (see below), whose sum is σ = 12028344. Its totient is φ = 10023600.
The previous prime is 11025929. The next prime is 11025983. The reversal of 11025971 is 17952011.
11025971 is digitally balanced in base 2, 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 a cyclic number.
It is not a de Polignac number, because 11025971 - 210 = 11024947 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11025971.
It is not an unprimeable number, because it can be changed into a prime (11825971) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 501170 + ... + 501191.
It is an arithmetic number, because the mean of its divisors is an integer number (3007086).
Almost surely, 211025971 is an apocalyptic number.
11025971 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11025971 is a deficient number, since it is larger than the sum of its proper divisors (1002373).
11025971 is a wasteful number, since it uses less digits than its factorization.
11025971 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1002372.
The product of its (nonzero) digits is 630, while the sum is 26.
The square root of 11025971 is about 3320.5377576531. The cubic root of 11025971 is about 222.5728987240.
Adding to 11025971 its reverse (17952011), we get a palindrome (28977982).
The spelling of 11025971 in words is "eleven million, twenty-five thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •