16043
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16368
- Proper Divisor Sum (Aliquot Sum)
- 325
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15720
- Möbius Function
- 1
- Radical
- 16043
- 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
- 71
- 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
- Positive numbers k such that k and 2*k are anagrams in base 8 (written in base 8).at n=32A023073
- a(n) = Sum_{k=0..n} (k+1) * A026747(n, n-k).at n=10A027228
- Number of trees with n nodes and 4 leaves.at n=39A055291
- Composite and every divisor (except 1) contains the digit 6.at n=0A062674
- a(n) = least k > 0 such that prime(k) == n (mod k).at n=36A073325
- Smallest composite number n such that every divisor > 1 includes n as a substring.at n=6A105582
- Numbers k such that 11k = 6j^2 + 6j + 1.at n=31A106388
- a(n) = (A114043(n) - 1)/2.at n=17A115005
- Composite numbers generated by the Euler polynomial x^2 + x + 41.at n=21A145292
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, 1, 1), (1, -1, -1), (1, 1, -1)}.at n=9A148811
- G.f.: limit of the ratio of the g.f.s of adjacent rows in triangle A152800.at n=31A152803
- Numbers such that n^2 = 29 mod 1193.at n=26A165989
- Prime-generating polynomial: a(n) = 16*n^2 - 300*n + 1447.at n=41A181973
- a(n) = 9*n^2 + 39*n + 83.at n=40A210527
- Number of sequences of n 2's and 3's with curling number 2, which have the form XY^2 with Y = 2, and which are robust.at n=16A217929
- Semiprimes generated by the Euler polynomial x^2 + x + 41.at n=21A228183
- Index of n in A125718, or 0 if n does not occur; A125718(k) = least number congruent to prime(k) (mod k) and not occurring earlier.at n=35A249678
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 643", based on the 5-celled von Neumann neighborhood.at n=22A273314
- Inverse binomial transform of A327743.at n=13A327457
- a(n) is the least k for which A340594(k) = n.at n=14A340595