16255
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19512
- Proper Divisor Sum (Aliquot Sum)
- 3257
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13000
- Möbius Function
- 1
- Radical
- 16255
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 190
- 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
- Sums of 3 distinct powers of 5.at n=27A038475
- Denominators of continued fraction convergents to sqrt(455).at n=4A041867
- At stage 1, start with a unit square. At each successive stage add 4*(n-1) new squares around outside with edge-to-edge contacts. Sequence gives number of squares (regardless of size) at n-th stage.at n=28A056640
- Centered 18-gonal numbers.at n=42A069131
- Triangle of numbers related to the generalized Catalan sequence C(2;n+1)=A064062(n+1), n>=0.at n=39A113647
- Sixth diagonal (M=6) sequence of triangle A113647, called Y(2,1).at n=3A115153
- Triangle A124029 with the (0,0) entry replaced by 4.at n=40A123966
- Triangle T(n,k) with the coefficient [x^k] of the characteristic polynomial of the following n X n triangular matrix: 4 on the main diagonal, -1 of the two adjacent subdiagonals, 0 otherwise.at n=40A124029
- Numbers whose base-10 and base-7 representations are permutations of the same multiset of digits.at n=32A130604
- a(n) = 1 if a(n-1) is prime, otherwise a(n-1) + a(n-2), with a(0) = 0 and a(1) = 1.at n=48A142878
- Numbers of length n binary words with fewer than 8 0-digits between any pair of consecutive 1-digits.at n=14A145116
- a(n) = 4^n - 2^n - 1.at n=7A156589
- Riordan array (1/(1+4x+x^2), x/(1+4x+x^2)).at n=40A159764
- Number of partitions of n such that the number of parts is divisible by the greatest part. Also number of partitions of n such that the greatest part is divisible by the number of parts.at n=49A168659
- Triangle of coefficients of Chebyshev's S(n,x+4) polynomials (exponents of x in increasing order).at n=40A207823
- Numbers in A206853 without proper divisors > 1 from the same sequence.at n=30A209630
- Number of partitions of n into exactly 7 different parts with distinct multiplicities.at n=18A212118
- Years >= 1801 in which Christmas falls in Sukkot.at n=3A222419
- Semiprimes of the form (2^k - m)*(m*2^k - 1).at n=17A239038
- Triangle read by rows: T(n,k) is the number of words over alphabet {0,1,2,3} having exactly k occurrences of the string 01, where n>=0 and k>=0.at n=46A261711