12773
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13068
- Proper Divisor Sum (Aliquot Sum)
- 295
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12480
- Möbius Function
- 1
- Radical
- 12773
- 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
- 37
- 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
- no
- Odd
- yes
Appears in sequences
- Multiplicity of trivial character in V_n, where V = Sum V_n is the graded module for the Monster simple group.at n=38A014810
- The sequence e when b=[ 1,1,0,1,1,... ].at n=50A042955
- McKay-Thompson series of class 12C for the Monster group.at n=12A058206
- Numbers k such that the product of the digits of k is equal to the sum of the prime factors of k, counted with multiplicity.at n=29A065774
- Numbers n such that the sum of the prime factors of n equals the product of the digits of n.at n=23A067173
- a(n) = prime(n) * prime(prime(n)).at n=15A073065
- Numbers k such that 2*10^k + 5*R_k + 2 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=11A099006
- Numbers k such that the k-th triangular number contains only digits {1,5,8}.at n=10A119137
- Numbers n where tau(n) and n-tau(n) are perfect squares, with tau(n) the number of divisors of n (A000005).at n=29A245197
- Irregular triangular array: row n gives numbers D, each being the discriminant of the minimal polynomial of a quadratic irrational represented by a continued fraction with period an n-tuple of 1s and 3s.at n=41A246921
- Irregular triangular array: every periodic simple continued fraction CF represents a quadratic irrational (c + f*sqrt(d))/b, where b,c,f,d are integers and d is squarefree. Row n of this array shows the distinct values of d as CF ranges through the periodic continued fractions having period an n-tuple of 1s and 3s.at n=41A246922
- Numbers whose arithmetic derivative is equal to the product of their digits.at n=8A266816
- Numbers k such that (8*10^k + 49)/3 is prime.at n=28A270890
- Number of integer partitions of n whose Durfee square has sides of even size.at n=38A274523
- 4*n analog to Keith numbers.at n=14A282759
- a(n) = prime(1)^2 + prime(n)^2.at n=29A287922
- Numbers k such that phi(k) = phi(2*k-1) where phi is the Euler totient function (A000010).at n=4A333407
- Number of sets of primes less than the n-th prime whose sum is the n-th prime.at n=51A334292
- Numbers that are the sum of nine fourth powers in nine or more ways.at n=20A345593
- Numbers that are the sum of nine fourth powers in exactly nine ways.at n=18A345851