16485
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
- 16
- Divisor Sum
- 30336
- Proper Divisor Sum (Aliquot Sum)
- 13851
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7488
- Möbius Function
- 1
- Radical
- 16485
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- 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
- 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
- Numbers whose base-4 representation contains exactly three 0's and four 1's.at n=24A045032
- a(n) = (n+3)*a(n-1) + a(n-2), with a(0)=0, a(1)=1.at n=6A058309
- Given the infinite continued fraction i+(i/(i+(i/(i+...)))), where i is the square root of (-1), this is the numerator of the real part of the convergents.at n=23A091806
- Indices of primes in the sequence defined by A(0) = 53, A(n) = 10*A(n-1) + 63 for n > 0.at n=20A101590
- Triangle read by rows. Let S(k) be the sequence defined by F(0)=0, F(1)=1, F(n-1) + (n+k)*F(n) = F(n+1). E.g. S(0) = 0, 1, 1, 3, 10, 43, 225, 1393, 9976, 81201, ... Then S(0), S(1), S(2), ... are written vertically, next to each other, with the initial term of each on the next row down.at n=49A102472
- Triangle read by rows. Let S(k) be the sequence defined by F(0)=0, F(1)=1, F(n-1) + (n+k)*F(n) = F(n+1). E.g. S(0) = 0,1,1,3,10,43,225,1393,9976,81201, ... Then S(0), S(1), S(2), ... are written next to each other, vertically, with the initial term of each on the next row down. The order of the terms in the rows are then reversed.at n=50A102473
- Numbers k such that k and 2*k, taken together are pandigital.at n=9A115922
- Pentagonal numbers divisible by 5.at n=42A117793
- a(n) = A001516(n)/2.at n=5A144659
- 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, 0, 1), (-1, 1, 1), (0, 1, -1), (1, -1, 0), (1, 0, 1)}.at n=8A149462
- One-half of averages of twin prime pairs of A001318.at n=14A154565
- Number of strictly increasing arrangements of 4 nonzero numbers in -(n+2)..(n+2) with sum zero.at n=41A188123
- Wiener index of a benzenoid consisting of a zig-zag chain of n hexagons (s=13; see the Gutman et al. reference).at n=13A193393
- A213784/12.at n=28A213789
- Odd indices n for which A046825(n) is not larger than A046825(n-1).at n=45A214453
- Triangle T(n,k), read by rows, giving the numerator of the coefficient of x^k in the Boros-Moll polynomial P_n(x) for n >= 0 and 0 <= k <=n.at n=25A223549
- Products p*q*r*s of distinct primes for which (p*q*r*s + 1)/2 is prime.at n=36A234501
- a(n) = n*(n + 1)*(3*n^2 + 3*n - 2)/8.at n=14A236770
- T(n,k) = 2*(K(n,2)*I(k,2) - (-1)^(n+k)*I(n,2)*K(k,2)), where I(n,x) and K(n,x) are Bessel functions; triangle read by rows for 0 <= k <= n.at n=59A246654
- a(n) = 2*(K(n,2)*I(4,2) - (-1)^n*I(n,2)*K(4,2)) where I(n,x) and K(n,x) are Bessel functions.at n=10A246662