4189
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4320
- Proper Divisor Sum (Aliquot Sum)
- 131
- 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
- 4060
- Möbius Function
- 1
- Radical
- 4189
- 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
- 126
- Smith Number
- yes
- 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
- Number of two-rowed partitions of length 3.at n=30A001993
- Nearest integer to 4 * Pi * n^3 / 3.at n=10A002101
- Smallest odd number expressible in at least n ways as p+2*m^2 where p is 1 or a prime and m >= 0.at n=31A007697
- Smallest odd number expressible in at least n ways as p+2*m^2 where p is 1 or a prime and m >= 0.at n=32A007697
- Coordination sequence T9 for Zeolite Code MFI.at n=41A008172
- Coordination sequence T1 for Zeolite Code MFS.at n=40A008173
- Consider all ways of writing a number as p+2m^2 where p is 1 or a prime and m >= 0; sequence gives numbers that are expressible in at least 2 more ways than any smaller number.at n=5A016067
- a(1) = 7; a(n+1) = a(n)-th composite.at n=25A025011
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 44 ones.at n=6A031812
- Numbers whose base-8 representation has exactly 5 runs.at n=18A043627
- Numbers whose base-4 representation contains exactly two 0's and four 1's.at n=13A045027
- a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 0,2,3.at n=14A049861
- Smallest integer that can be expressed as p+2m^2 in more ways than any smaller number, where m >= 0 and p = 1 or prime.at n=25A055202
- McKay-Thompson series of class 47A for the Monster group.at n=48A058690
- a(n) = least odd number which can be represented in the form p + 2*k^2, k>0, in n different ways.at n=33A060004
- Numerator of 1/36 - 1/n^2.at n=64A061045
- a(n) = floor(log(n)^n).at n=9A061566
- Nearest integer to log(n)^n.at n=9A062460
- When the numerator - denominator (A064169) in n-th harmonic number is prime.at n=50A064404
- In base 2: n sets a new record for the number of 'Reverse and Add' steps needed to reach a palindrome starting with n.at n=10A066144