12452
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
- 12
- Divisor Sum
- 23856
- Proper Divisor Sum (Aliquot Sum)
- 11404
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5640
- Möbius Function
- 0
- Radical
- 6226
- Omega Function (Ω)
- 4
- 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
- no
- 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
- 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 partitions into non-integral powers.at n=42A000148
- Number of self-converse oriented graphs with n nodes.at n=6A005639
- Positive numbers k such that k and 2*k are anagrams in base 8 (written in base 8).at n=24A023073
- Triangle T(n,k), 0<=k<=n, of coefficients of polynomials P_n(x) related to convolution of the k-fold factorials.at n=61A113129
- a(n) = A113129(2*n+2,n+2) for n>=0.at n=4A113332
- Least K such that K*(prime(100*n)^(100*n))-1 is prime with prime(n)=n-th prime.at n=9A129245
- Number of ways to place n+2 queens and 2 pawns on an n X n board so that no two queens attack each other.at n=10A129551
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 0110-0110-1111 pattern in any orientation.at n=15A147358
- Number of line segments connecting exactly 8 points in an n x n grid of points.at n=36A177724
- Number of distinct values taken by 10th derivative of x^x^...^x (with n x's and parentheses inserted in all possible ways) at x=1.at n=12A216403
- Number of nX3 arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 nX3 array.at n=6A219376
- T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 nXk array.at n=42A219381
- Number of 7Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 7Xn array.at n=2A219387
- a(n) = sigma(n)*pi(n^2), where sigma(n) is the sum of all (positive) divisors of n, and pi(x) is the number of primes not exceeding x.at n=42A263325
- Numbers n such that Bernoulli number B_{n} has denominator 690.at n=18A272186
- a(n) = 3*a(n-1) - 3*a(n-2) + 2*a(n-3) - 2*a(n-4) + a(n-5) for n >= 10, a(0) = 2, a(1) = 4, a(2) = 7, a(3) = 12, a(4) = 20, a(5) = 32, a(6) = 50, a(7) = 77, a(8) = 116, a(9) = 174.at n=20A289115
- The first Zagreb index of the Aztec diamond AZ(n) (see the Ramanes et al. reference, Theorem 2.1).at n=18A292344
- Partial sums of A299257.at n=25A299263
- Numbers k such that usigma(k) = round(zeta(2)/zeta(3)*k), where usigma(k) is the sum of unitary divisors of k (A034448).at n=11A308045
- Numbers that are the sum of an emirp and its reversal in more than one way.at n=20A345408