12868
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 22526
- Proper Divisor Sum (Aliquot Sum)
- 9658
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6432
- Möbius Function
- 0
- Radical
- 6434
- Omega Function (Ω)
- 3
- 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
- 76
- 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
- Number of lines through exactly 5 points of an n X n grid of points.at n=45A018812
- Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2); sequence gives values of u1.at n=29A048189
- Engel series expansion (or "Egyptian product") for Khintchine's constant.at n=10A054544
- a(n) = round(sqrt(Fibonacci(n))).at n=41A100665
- Number of different ways to select n elements from two sets of n elements under the precondition of choosing at least one element from each set.at n=7A115112
- Numbers n such that n^24 + 1 = p*q with p,q distinct primes.at n=23A119982
- a(n) = round(Pi*2^(n-1)) for n >= 1, a(0) = 1.at n=13A121349
- Integer part of Gauss's Arithmetic-Geometric Mean M(2,n^5).at n=9A127766
- Ceiling(4*Pi*n^2).at n=31A135971
- Nearest integer to 2^n*Pi/4.at n=14A155996
- Number of n X 8 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.at n=7A166813
- A115112 with initial term changed from 0 to 1.at n=7A171074
- T(n,k) = Sum of multinomial(n; n_1,n_2,...,n_k)^2, where the sum extends over all compositions (n_1,n_2,...,n_k) of n into exactly k nonnegative parts.at n=29A192722
- a(n) = binomial(n, [n/2]) - 2.at n=16A201686
- Ordered differences of central binomial coefficients.at n=29A205008
- Sum of successive absolute differences of the binomial coefficients = 2*A014495(n).at n=15A218008
- Number of permutations of [n] having a shortest ascending run of length 7.at n=8A228674
- Number of sets of 4 distinct collinear points in an n X n permutation array in which leftmost pair has same spacing as rightmost pair.at n=17A234471
- a(n) = ceiling(Pi*n^3).at n=16A247194
- Number of binary words of length n with exactly one occurrence of subword 010 and exactly one occurrence of subword 101.at n=17A255386