1481
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1482
- 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
- 1480
- Möbius Function
- -1
- Radical
- 1481
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 34
- 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
- 234
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of partitions of n into relatively prime parts. Also aperiodic partitions.at n=24A000837
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/4.at n=12A001134
- Lesser of twin primes.at n=48A001359
- Primes of the form k^2 - k - 1.at n=21A002327
- Divisible only by primes congruent to 4 mod 7.at n=43A004622
- a(n) = round(n*phi^7), where phi is the golden ratio, A001622.at n=51A004942
- a(n) = ceiling(n*phi^7), where phi is the golden ratio, A001622.at n=51A004962
- Sophie Germain primes p: 2p+1 is also prime.at n=48A005384
- Prime triples: p; p+2 or p+4; p+6 all prime.at n=38A007529
- Prime quadruples: numbers k such that k, k+2, k+6, k+8 are all prime.at n=5A007530
- Numbers n such that n, 2n+1, and 4n+3 all prime.at n=14A007700
- Primes p == 1 (mod 8), p = a^2 +64*b^2 such that y^2 = x^3 + p*x has rank 0.at n=5A007765
- Coordination sequence T2 for Zeolite Code DAC.at n=24A008068
- Coordination sequence T4 for Zeolite Code DDR.at n=24A008074
- Coordination sequence T7 for Zeolite Code EUO.at n=24A008102
- Expansion of 1/( Product_{j=0..5} (1-x^(2*j+1)) ).at n=54A008675
- Coordination sequence T1 for Zeolite Code AHT.at n=26A009866
- Coordination sequence T5 for Zeolite Code VNI.at n=24A009911
- exp(sinh(x)+log(x+1))=1+2*x+3/2!*x^2+5/3!*x^3+13/4!*x^4+37/5!*x^5...at n=8A013013
- Partial sums of primes, if 1 is regarded as a prime (as it was until quite recently, see A008578).at n=29A014284