13554
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 30240
- Proper Divisor Sum (Aliquot Sum)
- 16686
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4500
- Möbius Function
- 0
- Radical
- 1506
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 89
- 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
- yes
- Odd
- no
Appears in sequences
- Representation degeneracies for Ramond strings.at n=18A005304
- Number of points on surface of tricapped prism: a(n) = 7*n^2 + 2 for n > 0, a(0)=1.at n=44A005919
- a(0) = 1, a(n) = 28*n^2 + 2 for n>0.at n=22A010018
- Denominators of continued fraction convergents to sqrt(391).at n=11A041743
- Global ranks of terms of A057122: tells which terms of A014486 form rooted plane binary trees also when interpreted as codes for ordinary rooted planar trees.at n=40A057123
- G.f. A(x) = (1 + x*A(3x))^2.at n=4A135870
- Number of distinct solutions of sum{i=1..2}(x(2i-1)*x(2i)) = 1 (mod n), with x() in 0..n-1.at n=46A180804
- Record (maximal) gaps between prime triples (p, p+4, p+6).at n=28A201596
- Numbers n such that n^16+1 and (n+2)^16+1 are both prime.at n=24A217991
- Number of distinct values of the sum of i^2 over 9 realizations of i in 0..n.at n=39A225276
- Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^17.at n=14A233556
- Number of (n+1) X (2+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=3A234484
- Number of (n+1) X (4+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=1A234486
- T(n,k) is the number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=11A234490
- T(n,k) is the number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=13A234490
- Number of partitions p of n such that 3*min(p) is a part of p.at n=37A238590
- Number of Carlitz compositions of n with exactly one descent.at n=27A241691
- Numbers n such that 1+16n^2, 1+16(n+1)^2 and 1+16(n+2)^2 are prime.at n=43A255635
- a(n) = (1/4)*A291024(n).at n=11A291142
- a(n) = Sum_{d|n} max(d, n/d)^3.at n=17A297842