16467
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24000
- Proper Divisor Sum (Aliquot Sum)
- 7533
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9960
- Möbius Function
- -1
- Radical
- 16467
- Omega Function (Ω)
- 3
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 146
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- [ (4th elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+3 odd positive integers}.at n=6A024203
- Numbers k such that 197*2^k+1 is prime.at n=13A032475
- Numbers whose base-4 representation contains exactly four 0's and three 1's.at n=26A045036
- a(n) = Sum_{d|n} d*2^(n/d - 1).at n=15A054599
- a(n) = Sum_{d|n, d odd} d*2^(n/d - 1), a(0)=0.at n=15A054601
- Coefficients of a polynomial used in calculation of A055913.at n=28A055916
- 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, 0), (1, -1, 1), (1, 1, -1)}.at n=9A148428
- Number of compositions of n into square parts k^2 where there are k sorts of part k^2.at n=23A240944
- Number of (n+2)X(3+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 2 or 4.at n=3A251677
- Number of (n+2)X(4+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 2 or 4.at n=2A251678
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 2 or 4.at n=17A251682
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 2 or 4.at n=18A251682
- Number of set partitions of [n] into exactly eight parts such that no part contains two elements with a circular distance less than three.at n=4A261484
- Value of the n-th Roman number interpreted as Latin alphabetic number.at n=11A285511
- a(n) is the sum of prime numbers between 2^n+1 and 2^(n+1).at n=8A293697
- Number of n X 3 0..1 arrays with every element equal to 1, 2 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=9A301994
- Number of partitions of n that contain {1,2} minus number of partitions of n that contain neither 1 nor 2.at n=39A324368
- The number of overpartitions of n having an equal number of overlined and non-overlined parts.at n=34A340659
- Consecutive states of the linear congruential pseudo-random number generator (2661*s + 36979) mod 175000 when started at s=1.at n=34A385361