15434
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 23154
- Proper Divisor Sum (Aliquot Sum)
- 7720
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7716
- Möbius Function
- 1
- Radical
- 15434
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 58
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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 k such that the continued fraction for sqrt(k) has period 65.at n=15A020404
- Numbers whose base-7 representation contains exactly four 6's.at n=8A043420
- Even elements of A085493.at n=33A106431
- Area of annuli of consecutive integer thickness.at n=16A114378
- Numbers whose square is a permutational number A134640.at n=45A134742
- a(n) = 441*n - 1.at n=34A158319
- a(n) = a(n-2)+a(n-4); a(1)=a(4)=101, a(2)=a(3)=10.at n=25A180236
- Number of 0..n arrays x(0..8) of 9 elements with zero 6th differences.at n=16A200276
- Number of (n+1)X(2+1) 0..2 arrays with the upper median unequal to the lower median in every 2X2 subblock.at n=2A236272
- Number of (n+1)X(3+1) 0..2 arrays with the upper median unequal to the lower median in every 2X2 subblock.at n=1A236273
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the upper median unequal to the lower median in every 2X2 subblock.at n=7A236278
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the upper median unequal to the lower median in every 2X2 subblock.at n=8A236278
- Number of partitions of n such that (number parts having multiplicity 1) is a part or (number of parts > 1) is a part.at n=37A241515
- Number of tilings of an n X 1 rectangle by tiles of dimension 1 X 1 and 2 X 1 such that every tile is next to a tile of different size.at n=33A245596
- 4-step Fibonacci sequence starting with 1,0,1,0.at n=18A251656
- Take a squarefree semiprime and take the difference of its prime factors. If it is a squarefree semiprime repeat the process. Sequence lists the squarefree semiprimes that generate other squarefree semiprimes only in the first k steps of this process. Case k = 4.at n=29A296811
- Take a squarefree semiprime and take the difference of its prime factors. If it is a squarefree semiprime repeat the process. Sequence lists the squarefree semiprimes that generate other squarefree semiprimes only in the first k steps of this process. Case k = 5.at n=7A296812
- Sum of the fourth largest parts in the partitions of n into 6 parts.at n=45A308870
- Irregular table read by rows: T(n,k) is the number of permutations in S_n that have exactly k occurrences of the pattern 2413. 0 <= k <= A342854(n).at n=53A342860