282
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 576
- Proper Divisor Sum (Aliquot Sum)
- 294
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 92
- Möbius Function
- -1
- Radical
- 282
- 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
- 16
- Smith 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
- yes
- Odd
- no
Names
- German
- zweihundertzweiundachtzig· ordinal: zweihundertzweiundachtzigste
- English
- two hundred eighty-two· ordinal: two hundred eighty-second
- Spanish
- doscientos ochenta y dos· ordinal: 282º
- French
- deux cent quatre-vingt-deux· ordinal: deux cent quatre-vingt-deuxième
- Italian
- duecentoottantadue· ordinal: 282º
- Latin
- ducenti octoginta duo· ordinal: 282.
- Portuguese
- duzentos e oitenta e dois· ordinal: 282º
Appears in sequences
- Number of positive integers <= 2^n of form x^2 + 3 y^2.at n=10A000205
- Number of plane partitions (or planar partitions) of n.at n=9A000219
- Number of ways to represent n using the binary operator a * b = 2^a + b.at n=10A000630
- Number of n X n matrices with nonnegative entries and every row and column sum 2.at n=4A000681
- Numbers that are not the sum of 4 tetrahedral numbers.at n=20A000797
- Numbers that are divisible by at least three different primes.at n=52A000977
- Number of partitions of n into at most 6 parts.at n=20A001402
- Number of 4 X 4 matrices with nonnegative integer entries and row and column sums equal to n.at n=2A001496
- A Beatty sequence: floor(n * (sqrt(5) + 3)).at n=53A001962
- Numbers congruent to {2, 4, 8, 16} (mod 20).at n=56A002081
- Palindromes in base 10.at n=37A002113
- Denominators of Bernoulli numbers B_{2n}.at n=23A002445
- Smallest number of stones in Tchoukaillon (or Mancala, or Kalahari) solitaire that make use of n-th hole.at n=29A002491
- A generalized partition function.at n=8A002603
- a(n) = Sum_{d|n, d <= 4} d^2 + 4*Sum_{d|n, d>4} d.at n=50A002791
- a(n) = nearest integer to n^(3/2).at n=43A002821
- Ulam numbers: a(1) = 1; a(2) = 2; for n>2, a(n) = least number > a(n-1) which is a unique sum of two distinct earlier terms.at n=53A002858
- Number of distinct values taken by 4^4^...^4 (with n 4's and parentheses inserted in all possible ways).at n=8A003019
- Value of an urn with n balls of type -1 and n balls of type +1.at n=5A003127
- Write down the numbers from 3 to infinity. Take next number, M say, that has not been crossed off. Counting through the numbers that have not yet been crossed off after that M, cross off the first, (M+1)st, (2M+1)st, (3M+1)st, etc. Repeat. The numbers that are left form the sequence.at n=47A003311