Base | Representation |
---|---|
bin | 101010110101… |
… | …101001001001 |
3 | 210010112100101 |
4 | 222311221021 |
5 | 10333323034 |
6 | 1040405401 |
7 | 164310565 |
oct | 52655111 |
9 | 23115311 |
10 | 11229769 |
11 | 6380101 |
12 | 3916861 |
13 | 2432545 |
14 | 16c46a5 |
15 | ebc514 |
hex | ab5a49 |
11229769 has 4 divisors (see below), whose sum is σ = 11286400. Its totient is φ = 11173140.
The previous prime is 11229763. The next prime is 11229791. The reversal of 11229769 is 96792211.
11229769 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, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 96792211 = 23 ⋅4208357.
It is a cyclic number.
It is not a de Polignac number, because 11229769 - 23 = 11229761 is a prime.
It is a super-2 number, since 2×112297692 = 252215423586722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11229761) 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, 28017 + ... + 28414.
It is an arithmetic number, because the mean of its divisors is an integer number (2821600).
Almost surely, 211229769 is an apocalyptic number.
It is an amenable number.
11229769 is a deficient number, since it is larger than the sum of its proper divisors (56631).
11229769 is an equidigital number, since it uses as much as digits as its factorization.
11229769 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56630.
The product of its digits is 13608, while the sum is 37.
The square root of 11229769 is about 3351.0847497490. The cubic root of 11229769 is about 223.9358407342.
The spelling of 11229769 in words is "eleven million, two hundred twenty-nine thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •