11002
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 4
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16506
- Proper Divisor Sum (Aliquot Sum)
- 5504
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5500
- Möbius Function
- 1
- Radical
- 11002
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 42
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 45.at n=27A020384
- The number of Apollonian networks (planar 3-trees) with n+3 vertices.at n=9A027610
- Lexicographically earliest strictly increasing base 3 autovarious sequence: a(n) = number of distinct a(k) mod 3^n (written in base 3).at n=16A037091
- Lexicographically earliest strictly increasing base 4 autovarious sequence: a(n) = number of distinct a(k) mod 4^n (written in base 4).at n=16A038113
- Coefficients of monic irreducible polynomials over GF(3) listed in lexicographic order.at n=20A058944
- Coefficients of monic primitive irreducible polynomials over GF(3) listed in lexicographic order.at n=9A058949
- Coefficients of irreducible polynomials over GF(3) listed in lexicographic order.at n=23A065020
- a(n) = 110 written in base n.at n=2A095610
- a(n) = 110 written in base 10 - n.at n=7A095611
- Inverse Moebius transform of Fibonacci numbers 0, 1, 1, 2, 3, 5, 8, ...at n=21A108046
- Triangle read by rows: number of labeled partitions of n with maximin m.at n=49A113547
- Numbers beginning with a vowel in French.at n=4A118557
- Take the base-3 representation of n, render that in decimal notation and take the base-3 representation of n again.at n=12A126135
- Numbers k such that k and k^2 use only the digits 0, 1, 2 and 4.at n=50A136816
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 4 and 7.at n=54A136819
- Number of ways to place zero or more nonadjacent 1,1 2,1 3,1 3,2 4,0 4,1 polyhexes in any orientation on a planar nXnXn triangular grid.at n=6A155270
- Primes in lunar arithmetic in base 3 written in base 3.at n=39A170806
- Numbers n such that sum of squares of factorials of digits of n is a power of 2.at n=26A174570
- Numbers 3*n + 2 written in base 3.at n=36A190642
- Constant term of the reduction by x^2->x+1 of the polynomial p(n,x) = 1 + x^n + x^(2n).at n=10A192464