11151
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 19200
- Proper Divisor Sum (Aliquot Sum)
- 8049
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6264
- Möbius Function
- 0
- Radical
- 1239
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
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
- 68
- Smith Number
- no
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers whose product of digits is prime.at n=46A028842
- Numbers having four 1's in base 10.at n=16A043496
- Prime(n)*prime(2*n)+prime(n)+prime(2*n).at n=18A072672
- Number of nonempty subsets of {1, 2, ..., n} with <=9 pairwise coprime elements.at n=24A187270
- Number of ways to place 3 nonattacking kings on an n X n cylindrical chessboard.at n=6A194651
- Numbers with digital product = 5.at n=11A199985
- Composite numbers whose product of digits is 5.at n=7A201054
- Numbers n with nonzero digits such that n*(product of digits of n) is a palindrome.at n=27A229550
- Number of partitions of n such that m(1) = m(3), where m = multiplicity.at n=45A240058
- Number of partitions p of n such that (number of numbers in p having multiplicity > 1) = number of 1s in p.at n=44A241090
- Number of partitions of n into 8 parts such that every i-th smallest part (counted with multiplicity) is different from i.at n=21A244244
- Triangle read by rows: coefficients of polynomials related to the exponential generating function of sequences generated by Narayana polynomials evaluated at the integers; n>=1, 0<=k<n.at n=31A247502
- Sum of numbers in the n-th antidiagonal of the reciprocity array of 3.at n=35A259583
- Numbers k such that (5*10^k + 91) / 3 is prime.at n=22A275020
- Numbers using only digits 1 and 5.at n=32A276037
- Product of digits is noncomposite.at n=52A307714
- Numbers whose digit product equals the number of their digits.at n=17A321771
- Number of strict rectangular plane partitions of n.at n=45A323431
- Lexicographically earliest sequence of distinct terms such that a(n) is divisible by four and only four digits of a(n+1).at n=36A326110
- a(n) is the smallest nonnegative integer m such that the integer part of tan(m) is equal to n.at n=12A327788