1534
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2520
- Proper Divisor Sum (Aliquot Sum)
- 986
- 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
- 696
- Möbius Function
- -1
- Radical
- 1534
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 60
- Smith Number
- no
- Vampire 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
Appears in sequences
- Number of key permutations of length n: permutations {a_i} with |a_i - a_{i-1}| = 1 or 2.at n=15A003274
- a(n) = 2^(n-1) + 2^[ n/2 ] + 2^[ (n-1)/2 ] - F(n+3).at n=12A005674
- Coordination sequence for quartz.at n=22A008261
- Coordination sequence for MgNi2, Position Ni3.at n=10A009934
- a(n) = prime(n)*(prime(n-1)-1)/2.at n=14A014302
- From table of maximal epacts e(p) and corresponding primes p, for x_1=2, x_{m+1} = (x_m)^2+1; sequence gives e(p).at n=44A014423
- a(1)=1, a(n) = n*7^(n-1) + a(n-1).at n=3A014920
- Numbers n such that phi(n) | sigma_7(n).at n=43A015765
- Fibonacci sequence beginning 2, 16.at n=11A022370
- Numbers with exactly 9 ones in binary expansion.at n=18A023691
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = (natural numbers), t = (natural numbers >= 3).at n=23A024854
- a(n) = floor(Sum_{1<=i<j<=n} (sqrt(j)-sqrt(i))^2).at n=29A025196
- Index of 10^n within the sequence of the numbers of the form 6^i*10^j.at n=48A025744
- a(2*n) = 3*2^n - 2; a(2*n+1) = 2^(n+2) - 2.at n=18A027383
- Sequence satisfies T^2(a)=a, where T is defined below.at n=31A027593
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 12 (most significant digit on right).at n=11A029505
- Least term in period of continued fraction for sqrt(n) is 6.at n=13A031430
- Number of bracelets (turnover necklaces) of n beads of 2 colors, 5 of them black.at n=22A032279
- a(n) = 3*2^n - 2.at n=9A033484
- Convolution of natural numbers n >= 1 with Fibonacci numbers F(k), k >= 4.at n=9A033960