13890
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 33408
- Proper Divisor Sum (Aliquot Sum)
- 19518
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3696
- Möbius Function
- 1
- Radical
- 13890
- 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
- 45
- 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
- Numbers that are the sum of 5 nonzero 8th powers.at n=14A003383
- Numerators of continued fraction convergents to sqrt(957).at n=4A042852
- a(n) = 3*2^n + 2*3^n.at n=8A094125
- 75-gonal numbers: a(n) = n*(73*n-71)/2.at n=20A098230
- Number of fusenes with 25 hexagons, C_(2v) symmetry and containing n carbon atoms.at n=12A123598
- G.f. satisfies: A(A(A(x))) = (1 + A(x))^2 - (1+x).at n=5A177749
- Number of -3..3 arrays x(0..n-1) of n elements with zeroth through n-1st differences all nonzero.at n=5A199938
- T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zeroth through n-1st differences all nonzero.at n=33A199943
- Number of -n..n arrays x(0..5) of 6 elements with zeroth through 5th differences all nonzero.at n=2A199947
- Number of 4 X n 0..1 arrays avoiding 0 0 1 and 1 0 1 horizontally and 0 1 0 and 1 0 1 vertically.at n=8A207255
- Largest number k such that phi(k) = A007374(n).at n=28A224532
- a(n) = Sum_{i=0..n} Sum_{j=0..n} (i XOR j), where XOR is the binary logical exclusive-or operator.at n=29A224923
- Number of (n+2)X(7+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=26A254906
- Numbers k such that Bernoulli number B_{k} has denominator 14322.at n=17A295588
- Number of ways to write n as an ordered sum of 10 nonzero triangular numbers.at n=24A340955
- Number of integer partitions of n with more than one non-mode.at n=35A363124