1370
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2484
- Proper Divisor Sum (Aliquot Sum)
- 1114
- 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
- 544
- Möbius Function
- -1
- Radical
- 1370
- 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
- 127
- 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
- a(n) = least m such that if a/b < c/d where a,b,c,d are integers in [0,n], then a/b < k/m < c/d for some integer k.at n=42A001000
- a(n) = sigma_2(n): sum of squares of divisors of n.at n=36A001157
- E.g.f.: 2*exp(x)/(1-x)^3.at n=4A001340
- a(n) = Sum_{k = 0..4} (n+k)! C(4,k).at n=3A001346
- a(n) = Sum_{d|n, d == 1 mod 4} d^2 - Sum_{d|n, d == 3 mod 4} d^2.at n=36A002173
- a(n) = n^2 + 1.at n=37A002522
- Numbers that are the sum of 12 positive 6th powers.at n=23A003368
- Optimal cost of search tree for searching an ordered array of n elements with cost k of probing element k.at n=25A007077
- McKay-Thompson series of class 9A for Monster.at n=6A007266
- Coordination sequence T5 for Zeolite Code MEL.at n=24A008154
- Expansion of Jacobi theta constant theta_2^6 /(64q^(3/2)).at n=27A008440
- If a, b in sequence, so is ab+6.at n=20A009307
- Coordination sequence for FeS2-Pyrite, Fe position.at n=18A009957
- a(n) = floor(n*(n-1)*(n-2)/16).at n=29A011898
- Expansion of g.f. 1/((1-2x)(1-3x)(1-9x)).at n=3A016278
- Numerator of sum of -2nd powers of divisors of n.at n=36A017667
- Number of partitions of n into divisors of n.at n=39A018818
- a(n) = a(n-1) + c(n) for n >= 3, a( ) increasing, given a(1)=1 a(2)=2; where c( ) is complement of a( ).at n=46A022946
- Numbers k such that Fibonacci(k) == -55 (mod k).at n=31A023170
- Convolution of A023532 and composite numbers.at n=46A023599