1870
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 3888
- Proper Divisor Sum (Aliquot Sum)
- 2018
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 640
- Möbius Function
- 1
- Radical
- 1870
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 130
- 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 free planar polyenoids with 2n nodes and symmetry point group C_{2h}.at n=8A000935
- Number of symmetric foldings of a strip of n blank stamps.at n=14A001010
- 10-gonal (or decagonal) numbers: a(n) = n*(4*n-3).at n=22A001107
- Golden rectangle numbers: F(n) * F(n+1), where F(n) = A000045(n) (Fibonacci numbers).at n=9A001654
- Primitive pseudoperfect numbers.at n=29A006036
- Primitive nondeficient numbers.at n=24A006039
- a(n) = a(n-1) + a(n-3) + a(n-4), a(0) = a(1) = a(2) = 1, a(3) = 2.at n=17A006498
- Coordination sequence T3 for Zeolite Code TON.at n=27A008243
- Coordination sequence for MgZn2, Mg position.at n=11A009939
- Triangle of Fibonomial coefficients, read by rows.at n=57A010048
- Triangle of Fibonomial coefficients, read by rows.at n=63A010048
- Numbers k such that C(k,3) = C(x,3) + C(y,3) is solvable.at n=45A010330
- a(n) = floor(n*(n-1)*(n-2)/21).at n=35A011903
- Orders of cyclotomic polynomials containing a coefficient the absolute value of which is >= 3.at n=17A013591
- a(n) = n*(13*n - 1)/2.at n=17A022270
- a(n) = n*(31*n-1)/2.at n=11A022288
- Positive numbers k such that k and 4*k are anagrams in base 9 (written in base 9).at n=9A023081
- Convolution of A001950 and A014306.at n=40A023669
- Base 6 expansion uses each positive digit just once.at n=1A023744
- a(n) = position of 2*n^3 in A003325.at n=51A024667