16425
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 29822
- Proper Divisor Sum (Aliquot Sum)
- 13397
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8640
- Möbius Function
- 0
- Radical
- 1095
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 97
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Convolution of composite numbers and odd numbers.at n=29A023650
- Denominators of continued fraction convergents to sqrt(152).at n=5A041279
- Denominators of continued fraction convergents to sqrt(608).at n=11A042167
- 9 times octagonal numbers: a(n) = 9*n*(3*n-2).at n=25A064201
- a(1)=5; a(n) is concatenation of squares of digits in a(n-1) (in base 10).at n=3A082026
- Number of n-crossing 3 component links with alternating braids of 3 strands.at n=18A094032
- Row sums of triangle A132073.at n=14A132074
- Triangle of numbers obtained from the partition array A134145.at n=30A134146
- 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, -1), (0, 1, 1), (1, -1, 1), (1, 0, 0)}.at n=8A150018
- a(n) = 73*n^2.at n=15A174334
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 6,0,0,0,0,1,1 for x=0,1,2,3,4,5,6.at n=4A197856
- Number of partitions of 2n into parts such that the largest multiplicity equals n.at n=46A232697
- Number of free pure symmetric multifunctions with one atom, n positions, and no empty or unitary parts (subexpressions of the form x[] or x[y]).at n=20A303027
- Number of subsets of {1..n} whose elements have the same smallest prime factor.at n=28A339510
- Integers m such that the decimal expansion of 1/m contains only even digits.at n=42A353613
- Nonsquarefree numbers k such that A003415(k) divides A276086(k), where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.at n=30A371085
- a(n) = Sum_{j=1..n} Sum_{k=1..n} phi(j*k) / phi(k).at n=34A372636
- Terms k of A228058 for which A048146(k)+A162296(k) >= 2*k, where A048146 is the sum of non-unitary divisors, and A162296 is the sum of divisors that have a square factor.at n=23A389219