1467
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 2132
- Proper Divisor Sum (Aliquot Sum)
- 665
- 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
- 972
- Möbius Function
- 0
- Radical
- 489
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of (1+x^3)/((1-x)*(1-x^2)^2*(1-x^3)).at n=35A001973
- Numbers that are the sum of 11 positive 6th powers.at n=23A003367
- Expansion of (1+x)(1+x^2)/(1-x-x^3).at n=18A003410
- a(n) = floor(tau*a(n-2)) + a(n-1) with a(0)=0 and a(1)=1.at n=14A005833
- Expansion of e.g.f. log(1 + tan(sin(x))).at n=7A009364
- arctanh(tan(sin(x)))=x+3/3!*x^3+41/5!*x^5+1467/7!*x^7+100625/9!*x^9...at n=3A012147
- a(n) = F(n) + L(n) + n, where F(n) (A000045) and L(n) (A000204) are Fibonacci and Lucas numbers respectively.at n=14A013915
- Positive integers n such that 2^n (mod n) == 2^9 (mod n).at n=63A015931
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MFI = ZSM-5 Nan[AlnSi96-nO192] starting with a T4 atom.at n=10A019161
- Values of n for which exp(Pi*sqrt(n)) is very close to an integer.at n=51A019296
- a(n) = n*(9*n + 1)/2.at n=18A022267
- Numbers k such that Fib(k) == -34 (mod k).at n=15A023169
- Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-9).at n=17A023439
- Ternary expansion uses each positive digit just once.at n=38A023741
- Numbers that are the sum of 4 positive cubes in exactly 2 ways.at n=43A025404
- Numbers that are the sum of 4 positive cubes in 2 or more ways.at n=44A025406
- Index of 9^n within the sequence of the numbers of the form 6^i*9^j.at n=48A025736
- Index of 9^n within the sequence of the numbers of the form 7^i*9^j.at n=50A025737
- (d(n)-r(n))/5, where d = A006527 and r is the periodic sequence with fundamental period (4,1,4,0,1).at n=26A026036
- Least k such that 1+2+...+k >= E{1,2,...,n}, where E = 2nd elementary symmetric function.at n=52A027916