9149
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10464
- Proper Divisor Sum (Aliquot Sum)
- 1315
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7836
- Möbius Function
- 1
- Radical
- 9149
- 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
- 122
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers such that ten iterations of Reverse and Add are needed to reach a palindrome.at n=3A015991
- Expansion of sum ( q^n / product( 1-q^k, k=1..5*n), n=0..inf ).at n=27A035297
- Numbers which need ten 'Reverse and Add' steps to reach a palindrome.at n=3A065215
- Frobenius number of the subsemigroup of the natural numbers generated by successive pairs of Lucas numbers.at n=8A105392
- Expansion of g.f. (1 +x^2)/((1-x)^2*(1 -3*x +2*x^2 -x^3)).at n=9A136303
- List of primes with digits grouped into clumps of four. Leading zeros are not printed.at n=18A136420
- Numbers k such that k^2 == 2 (mod 23^2).at n=34A156849
- Number of reduced words of length n in the Weyl group D_7.at n=13A162210
- Number of reduced words of length n in the Weyl group D_7.at n=29A162210
- Total sum of parts of multiplicity 10 in all partitions of n.at n=39A222738
- Number of n X 3 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 4 binary array having a sum of one or less, with rows and columns of the latter in lexicographically nondecreasing order.at n=7A227162
- T(n,k)=Number of nXk 0,1 arrays indicating 2X2 subblocks of some larger (n+1)X(k+1) binary array having a sum of one or less, with rows and columns of the latter in lexicographically nondecreasing order.at n=47A227165
- T(n,k)=Number of nXk 0,1 arrays indicating 2X2 subblocks of some larger (n+1)X(k+1) binary array having a sum of one or less, with rows and columns of the latter in lexicographically nondecreasing order.at n=52A227165
- Number of partitions p of n such that m(p) = m(c(p)), where m = minimal multiplicity of parts, and c = conjugate.at n=32A240731
- a(n) = greatest k such that A155043(k+A262509(n)) < A155043(A262509(n)).at n=58A262909
- Coinage sequence: a(n) = A018227(n)-7.at n=34A272000
- Bases b where exactly seven primes p with p < b exist such that p is a base-b Wieferich prime.at n=19A325883
- Number of integer partitions of n having a unique part of least multiplicity.at n=42A362610