11190
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 26928
- Proper Divisor Sum (Aliquot Sum)
- 15738
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2976
- Möbius Function
- 1
- Radical
- 11190
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 130
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Number of fullerenes with 2n vertices (or carbon atoms).at n=26A007894
- Numbers in which 0,1,2,3,4,5 all occur in base 6.at n=33A031947
- Numbers whose set of base-14 digits is {1,4}.at n=23A032826
- Numbers whose base-7 representation contains exactly four 4's.at n=14A043412
- Numbers with exactly 4 distinct palindromic prime factors.at n=25A046402
- Digitally balanced numbers in base 6: equal numbers of 0's, 1's, ..., 5's.at n=33A049357
- a(n) = Sum_{i=1..n} n^i * (n - i).at n=5A062808
- Erroneous version of A007894.at n=19A122661
- Base-2 logarithm of (n-th even superperfect number divided by 2^n), plus 1.at n=22A134713
- a(n) = 361*n - 1.at n=30A158308
- Describe 10^n. Also called the "Say What You See" or "Look and Say" sequence LS(10^n).at n=19A191111
- Number of partitions of n^2 into at most 9 square parts.at n=30A255213
- Numbers k such that (89*10^k - 179)/9 is prime.at n=18A295129
- Triangle read by rows: T(n,k) is the coefficient of (1+x)^k in the ZZ polynomial of the hexagonal graphene flake O(3,3,n).at n=65A338217
- Numbers that are the sum of ten fourth powers in exactly ten ways.at n=38A345862
- a(n) is the smallest number which can be represented as the sum of n distinct nonzero n-gonal numbers in exactly n ways, or 0 if no such number exists.at n=12A350405
- Number of nonempty subsets of {1, 2, ..., n} with GCD equal to 1 and containing the sum of any two elements whenever it is at most n.at n=22A358392