1451
domain: N
Properties
Digital Properties
- Digit Count
- 4
- 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
- 1452
- 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
- 1450
- Möbius Function
- -1
- Radical
- 1451
- 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
- 140
- Smith Number
- no
- Vampire 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 230
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p == 3, 9, 11 (mod 20) such that 2p+1 is also prime.at n=24A000355
- Lesser of twin primes.at n=47A001359
- Lucasian primes: p == 3 (mod 4) with 2*p+1 prime.at n=24A002515
- a(1) = 1; for n>1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1).at n=45A003508
- a(n) = n^3 + n^2 - 1.at n=10A003777
- 5!(2n-6)!/n!(n-1)! is an integer.at n=13A004785
- Sequence and first differences (A030124) together list all positive numbers exactly once.at n=48A005228
- Sophie Germain primes p: 2p+1 is also prime.at n=47A005384
- Numbers n such that n, 2n+1, and 4n+3 all prime.at n=13A007700
- Expansion of (x^6-x^5-x^4+2x^2)/((1-x^3)(1-x^2)^2(1-x)).at n=42A007988
- Coordination sequence T1 for Zeolite Code NON.at n=23A008212
- If a, b in sequence, so is ab+5.at n=22A009304
- If a, b in sequence, so is ab+7.at n=18A009312
- a(n) = b(n) - c(n) where b(n) = [ (3/2)^n ] and c(n) is the n-th number not in sequence b.at n=17A014250
- Expansion of 1/(1-x^6-x^7-x^8-x^9-x^10).at n=45A017850
- Numbers k such that the continued fraction for sqrt(k) has period 34.at n=6A020373
- Smallest nonempty set S containing prime divisors of 8k+3 for each k in S.at n=44A020617
- n-th prime p(k) such that p(k) + p(k+5) = p(k+1) + p(k+4).at n=47A022889
- a(n) = a(n-1) + c(n-1) for n >= 2, a( ) increasing, given a(1)=3, where c( ) is complement of a( ).at n=48A022935
- a(n) = a(n-1) + c(n+1) for n >= 3, a( ) increasing, given a(1)=1, a(2)=7; where c( ) is complement of a( ).at n=47A022953