16293
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 21728
- Proper Divisor Sum (Aliquot Sum)
- 5435
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10860
- Möbius Function
- 1
- Radical
- 16293
- 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
- 97
- 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
- a(n) = 2^n - n*(n-1)/2.at n=14A014844
- Leading diagonal of triangle in A080521.at n=13A080522
- Expansion of 1/((1-2*x)*(1+x+2*x^2)).at n=15A089977
- Indices of primes in sequence defined by A(0) = 83, A(n) = 10*A(n-1) + 33 for n > 0.at n=19A101074
- Semiprimes in A103378.at n=17A103398
- Triangle read by rows: T(n,k) = number of partitions of binomial(n,k) into distinct parts of the first n rows of Pascal's triangle, 0<=k<=n.at n=70A132312
- Triangle read by rows: T(n,k) = number of partitions of binomial(n,k) into distinct parts of the first n rows of Pascal's triangle, 0<=k<=n.at n=73A132312
- Values of m such that A139361(n)=4m+1.at n=33A139362
- Triangle of 3-Eulerian numbers.at n=30A144697
- 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, -1), (-1, -1, 1), (-1, 0, 1), (1, 0, -1), (1, 1, 1)}.at n=8A149567
- Smallest m such that A258062(m) = n.at n=30A258063
- Irregular triangle read by rows: T(n,k) is the number of distinct Wilf classes of subsets of exactly k patterns in S_n, for 0 <= k <= n!.at n=22A346624
- Numbers k such that k, k + 1, k + 2, and k + 4 are all semiprimes.at n=46A368670