13433
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16320
- Proper Divisor Sum (Aliquot Sum)
- 2887
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10800
- Möbius Function
- -1
- Radical
- 13433
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 94
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that 255*2^k+1 is prime.at n=36A032504
- Number of partitions of n with equal number of parts congruent to each of 1 and 4 (mod 5).at n=48A035558
- Numerators of continued fraction convergents to sqrt(864).at n=6A042668
- Numbers k such that sopfr(k) = sopfr(k + sopfr(k)).at n=19A050780
- a(1)=1, a(n+1) = a(n) + spf(Sum_{i=1..n} a(i)), where spf=A020639 (smallest prime factor).at n=29A080180
- a(n) = index of the first occurrence of n in A088606.at n=40A088757
- a(n) = (1/24)*(n+1)*(n+3)*(n^2+22*n+88).at n=19A090950
- a(n) = n*(n-th prime) + (n+1)*((n+1)-th prime).at n=38A152117
- a(n) = floor(sqrt(2*n^5)).at n=39A172473
- a(n) = n*(19*n-15)/2.at n=38A226490
- Maximal balanced binary trees in the Tamari lattices.at n=27A272371
- Numbers k such that k![12]-2 is prime, where k![12] is the twelve-fold multifactorial.at n=46A284132
- Numbers k such that k!6 + 12 is prime, where k!6 is the sextuple factorial number (A085158 ).at n=33A288155
- Number of integer-sided pentagons having perimeter n, modulo rotations but not reflections.at n=36A293822
- G.f. A(x) satisfies: A(x) = x + x^2 * exp( Sum_{k>=1} (-1)^(k+1) * A(x^k)^3 / (k*x^(2*k)) ).at n=10A363467
- Number of subsets of {1..n} containing n but not containing the sum of any two distinct elements.at n=22A364755
- Numbers that are the concatenation of three (not necessarily distinct) primes whose sum is prime, and are also the product of three (not necessarily distinct) primes whose sum is prime.at n=30A385452