12767
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13536
- Proper Divisor Sum (Aliquot Sum)
- 769
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12000
- Möbius Function
- 1
- Radical
- 12767
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 200
- 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
- Numbers k such that p-k=p#-k#, where p=nextprime(k), k#=nextprime(square root of k), p#=nextprime(square root of p).at n=3A037210
- a(n) = prime(n)^2 - 2.at n=29A049001
- Pseudo-random numbers: a (very weak) pseudo-random number generator from the second edition of the C book.at n=11A061364
- Array read by antidiagonals: T(k,d) = number of different hyperplanes in d-space with integer coefficients in set {-k,...,-1,0,1,...,k}.at n=30A061559
- Non-palindromic number and its reversal are both multiples of 17.at n=30A062915
- Numbers n such that sigma (phi ( n ) ) = sigma (sigma (n ) ) where phi is Euler's totient and sigma is the multiplicative sum-of-divisors function.at n=9A065556
- Partial sums of A034953(n).at n=18A085739
- 2*JacobiSymbol(p,5) mod p^2 for p=prime(n).at n=29A113651
- Coefficients in the expansion of C^2/B^3, in Watson's notation of page 118.at n=13A160526
- Expansion of e.g.f. exp(A006351(x)).at n=6A217061
- Numbers n such that n!3 + 3^2 is prime.at n=39A247865
- a(n) = n^3 + (n+1)*(n+2).at n=23A270109
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 163", based on the 5-celled von Neumann neighborhood.at n=26A270455
- Numerator of the coefficient of the n-th term of the power expansion near x = 0 of sqrt(1+1/sqrt(1-x))/sqrt(2).at n=4A295074
- Number of 3Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2 or 4 neighboring 1s.at n=9A297735
- a(n) = (3 + 2*n - 3*n^2 + 4*n^3 - 3*((-1 + n) mod 2))/6.at n=26A304487
- Composite numbers k with its divisors having the property that the last digit of every divisor is the same as the first digit of the next divisor.at n=16A307858
- Array read by downward antidiagonals: A(n,k) = A(n-1,k+1) + 2*(k+1)!*Sum_{j=0..k} A(n-1,j)/j! with A(0,k) = 1, n >= 0, k >= 0.at n=20A379458