461
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 462
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 460
- Möbius Function
- -1
- Radical
- 461
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 35
- Smith Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 89
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- vierhunderteinundsechzig· ordinal: vierhunderteinundsechzigste
- English
- four hundred sixty-one· ordinal: four hundred sixty-first
- Spanish
- cuatrocientos sesenta y uno· ordinal: 461º
- French
- quatre cent soixante et un· ordinal: quatre cent soixante et unième
- Italian
- quattrocentosessantuno· ordinal: 461º
- Latin
- quadringenti sexaginta unus· ordinal: 461.
- Portuguese
- quatrocentos e sessenta e um· ordinal: 461º
Appears in sequences
- Let A(n) = #{(i,j,k): i^2 + j^2 + k^2 <= n}, V(n) = (4/3)Pi*n^(3/2), P(n) = A(n) - V(n); sequence gives values of n where |P(n)| sets a new record.at n=19A000092
- H_n(-1/2), where H_n(x) is Hermite polynomial of degree n.at n=7A000321
- Number of partitions into non-integral powers.at n=12A000327
- Irregular primes: primes p such that at least one of the numerators of the Bernoulli numbers B_2, B_4, ..., B_{p-3} (A000367) is divisible by p.at n=24A000928
- Twin primes.at n=45A001097
- Primes with primitive root 2.at n=35A001122
- Lesser of twin primes.at n=23A001359
- Number of stacks, or arrangements of n pennies in contiguous rows, each touching 2 in row below.at n=18A001524
- Artiads: the primes p == 1 (mod 5) for which Fibonacci((p-1)/5) is divisible by p.at n=3A001583
- Numbers k such that phi(k+2) = phi(k) + 2.at n=38A001838
- Full reptend primes: primes with primitive root 10.at n=31A001913
- Primes p such that the congruence 2^x == 3 (mod p) is solvable.at n=51A001915
- Primes p such that the congruence 2^x = 5 (mod p) is solvable.at n=48A001916
- Pythagorean primes: primes of the form 4*k + 1.at n=43A002144
- Primitive roots that go with the primes in A029932.at n=22A002231
- Primes congruent to 1 or 2 modulo 4; or, primes of form x^2 + y^2; or, -1 is a square mod p.at n=44A002313
- Primes of the form k^2 - k - 1.at n=14A002327
- Quintan primes: p = (x^5 + y^5)/(x + y).at n=4A002650
- a(n) = A001950(A003234(n)) + 1.at n=48A003249
- Number of connected permutations of [1..n] (those not fixing [1..j] for 0 < j < n). Also called indecomposable permutations, or irreducible permutations.at n=6A003319