1490
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2700
- Proper Divisor Sum (Aliquot Sum)
- 1210
- 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
- 592
- Möbius Function
- -1
- Radical
- 1490
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 91
- 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
- Tetranacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) for n >= 4 with a(0) = a(1) = a(2) = 0 and a(3) = 1.at n=15A000078
- a(n) = floor(sinh(n)).at n=8A000471
- Nearest integer to sinh(n).at n=8A000495
- a(n) = floor(cosh(n)).at n=8A000501
- Nearest integer to cosh(n).at n=8A002459
- Coordination sequence T1 for Zeolite Code MFS.at n=24A008173
- Coordination sequence T6 for Zeolite Code MFS.at n=24A008178
- Expansion of (1-x^5) / (1-x)^5.at n=12A008487
- Coordination sequence T1 for Zeolite Code RSN.at n=25A009885
- Numbers k such that the continued fraction for sqrt(k) has period 5.at n=37A010337
- Apply partial sum operator thrice to Fibonacci numbers.at n=11A014162
- Powers of fifth root of 21 rounded down.at n=12A018174
- Powers of fifth root of 21 rounded to nearest integer.at n=12A018175
- Numbers k such that Fibonacci(k) == 55 (mod k).at n=26A023181
- a(n) = integer nearest a(n-1)/(sqrt(7) - 2), where a(1) = 1.at n=16A024567
- Sum of remainders of n mod prime(k), for k = 1,2,3,...,n.at n=44A024925
- Coordination sequence T1 for Zeolite Code IFR.at n=27A024982
- a(n) = n^2 + n + 8.at n=38A027693
- a(n) = T(n, 2*n-10), T given by A027926.at n=8A027933
- a(n) = T(2n+1, n+2), T given by A027935.at n=5A027942