16237
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17500
- Proper Divisor Sum (Aliquot Sum)
- 1263
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14976
- Möbius Function
- 1
- Radical
- 16237
- 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
- 66
- 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
- Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); A000099 gives values of n where |P(n)| sets a new record; sequence gives A(A000099(n)).at n=31A000323
- Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); A000099 gives values of n where |P(n)| sets a new record; sequence gives A(A000099(n)).at n=32A000323
- Strong pseudoprimes to base 34.at n=14A020260
- Fibonacci sequence beginning 1, 26.at n=15A022396
- Numbers whose set of base-11 digits is {1,2}.at n=36A032931
- Sum of the next n members of the list of twin primes.at n=12A038345
- Number of independent vertex sets in the n-prism graph Y_n = K_2 X C_n (n > 2).at n=11A051927
- Let b(1)=b(2)=1, b(k) = (2^b(k-1)+2^b(k-2)) (mod k); sequence gives values of n such that b(n)=0.at n=36A074782
- Non-palindromic n and its digit reversal have the same sum of prime factors (with repetition).at n=38A085607
- Main diagonal of triangle A100226.at n=11A100227
- Minimal value of sum(p(i)p(i+1),i=1..n), where p(n+1)=p(1), as p ranges over all permutations of {1,2,...,n}.at n=44A110611
- a(1)=1, a(n)=a(n-1)+n^2 if n odd, a(n)=a(n-1)+ n^0 if n is even.at n=44A140148
- Continued fraction expansion for exp( Sum_{n>=1} 1/(n*A002203(n)) ), where A002203(n) = (1+sqrt(2))^n + (1-sqrt(2))^n.at n=16A174504
- Number of (w,x,y,z) with all terms in {1,...,n} and median<=mean.at n=13A212134
- Number of partitions p of n such that m(p) = m(c(p)), where m = minimal multiplicity of parts, and c = conjugate.at n=35A240731
- Expansion of Product_{k>=1} 1/(1-x^k)^(k*(k-1)*(k-2)/6).at n=16A258352
- Non-palindromic composite numbers such that n' = [Rev(n)]', where n' is the arithmetic derivative of n.at n=10A259077
- Number of length-n 0..6 arrays with no repeated value differing from the previous repeated value by more than one.at n=4A269581
- T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by more than one.at n=49A269583
- Number of length-5 0..n arrays with no repeated value differing from the previous repeated value by more than one.at n=5A269585