16373
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18720
- Proper Divisor Sum (Aliquot Sum)
- 2347
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14028
- Möbius Function
- 1
- Radical
- 16373
- 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
- T(n,1) + T(n,2) + ... T(n,n), where T is the array in A026098.at n=28A026101
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 18.at n=53A050967
- Position of sqrt(n) in the mapping N2QuQR1 given in A065936.at n=11A065938
- a(n) = 2^(n + 11) - 11.at n=3A098808
- Values of A102370 which are >= a new power of 2.at n=13A103529
- Number of primes between (prime(n + 1))^Pi and (prime(n))^Pi.at n=24A137380
- 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, 0, 0), (0, 1, -1), (1, -1, -1), (1, 1, 1)}.at n=8A149593
- Partial sums of A164095.at n=20A164096
- Number of strings of numbers x(i=1..n) in 0..2 with sum i^2*x(i) equal to n^2*2.at n=19A183946
- Let F(x) = 1 + 1*x + 4*x^2 + 10*x^3 + ..., the g.f. for A000293 (solid partitions), and write F(x) = 1/Product_{n>=1} E(n)^a(n) where E(n) = Product_{k>=n} (1 - x^(n*k)).at n=21A193718
- Sum of smallest parts of all partitions of n into an odd number of parts.at n=38A222044
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 846", based on the 5-celled von Neumann neighborhood.at n=13A284297
- a(n) = 16*2^n - 11 (n>=1).at n=9A304517
- Least k > 1 such that k^n is a twin rank (cf. A002822: 6*k^n +- 1 are twin primes).at n=38A326230
- Positive numbers k such that -k, -(k + 1), -(k + 2), and -(k + 3) are 4 consecutive negative negabinary-Niven numbers (A331728).at n=10A331825
- Number of integer partitions of n with a difference < -1 and a conjugate difference < -1.at n=36A350839
- Numbers k such that k, k+1, k+2, k+3 have 2, 3, 4, 5 prime factors respectively, counted with multiplicity.at n=18A363391