11790
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 30888
- Proper Divisor Sum (Aliquot Sum)
- 19098
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3120
- Möbius Function
- 0
- Radical
- 3930
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 81
- Smith Number
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-6).at n=23A023436
- Expansion of 1/((1-5x)(1-7x)(1-10x)(1-11x)).at n=3A028187
- Numbers k whose decimal representation, read as a base-12 value and divided by k, yields an integer.at n=10A032555
- Triangle read by rows: T(n,k) is the number of labeled commutative monoids of order n with k idempotents and a fixed identity.at n=18A058160
- Minimal k > n such that (4k+3n)(4n+3k) is a square.at n=29A083752
- Numbers n = concat(a,b) such that phi(n) = phi(a) * phi(b), where phi = A000010.at n=22A147619
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 0), (1, -1), (1, 1)}.at n=9A151271
- a(n) = 10*a(n-1) + 10*a(n-2), with a(0)=1, a(1)=9, a(2)=99.at n=4A155157
- a(1)=4. a(n) = a(n-1) + n, if a(n-1)+n is composite. Otherwise a(n) = a(n-1)*n.at n=8A175459
- Numbers n such that d(n + d(n)) = d(n), where d(n) is the sum of the distinct primes dividing n.at n=17A175760
- Smallest number k such that k^n is the sum of numbers in a twin prime pair.at n=31A195336
- Smallest integer areas of integer-sided triangles where at least one side is of length prime(n).at n=31A229159
- Number of partitions of n such that m(greatest part) <= m(1), where m = multiplicity.at n=35A240077
- Triangle read by rows: T(n,m) (n >= 1, 1 <= m <= n) = number of set partitions of [n], avoiding 12343, with m blocks.at n=49A250118
- Expansion of b(2)*b(6)/(1 - 2*x + x^3 - x^4 - x^5 + 2*x^6), where b(k) = (1-x^k)/(1-x).at n=13A264079
- Number of integers in n-th generation of tree T(-1/3) defined in Comments.at n=31A274148
- Coordination sequence for "tcd" 3D uniform tiling.at n=39A299287
- Number of ways to write n as an ordered sum of 9 prime powers (including 1).at n=8A341138