12530
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 13390
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- yes
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4272
- Möbius Function
- 1
- Radical
- 12530
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 86
- 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
- yes
- Odd
- no
Appears in sequences
- Weird numbers: abundant (A005101) but not pseudoperfect (A005835).at n=14A006037
- Coefficients of the '2nd-order' mock theta function A(q).at n=36A006304
- Fibonacci sequence beginning 2, 32.at n=14A022378
- Number of 1's in n-th term of A022470.at n=35A022472
- 23-gonal numbers: a(n) = n(21n-19)/2.at n=35A051875
- a(n) = (n + 2)*(2*n^2 - n + 3)/6.at n=33A056520
- a(n) = (2*n - 1)*(7*n^2 - 7*n + 6)/6.at n=17A063490
- Unitary weird numbers: unitary abundant (A034683) but not unitary pseudoperfect (A293188).at n=11A064114
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, 1, 1), (1, 0, -1), (1, 1, 1)}.at n=7A150836
- a(n) = 64*n^2 - n.at n=13A157948
- a(n) = 256*n^2 - 2*n.at n=6A158249
- a(n) = 196*n^2 - 14.at n=7A158553
- a(n) = (n^3 + 4*n^2 - n)/2.at n=27A162260
- Number of (n+2) X 10 binary arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=12A190032
- Number of n X 2 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,1,0,0,0 for x=0,1,2,3,4.at n=13A197469
- Total number of sequences with p_j copies of j and longest increasing subsequence of length k summed over all partitions [p_1, p_2, ..., p_k] of n.at n=9A268698
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 942", based on the 5-celled von Neumann neighborhood.at n=29A273797
- Bi-unitary weird numbers: bi-unitary abundant numbers (A292982) that are not bi-unitary pseudoperfect (A292985).at n=16A292986
- Infinitary weird numbers: infinitary abundant numbers (A129656) that are not infinitary pseudoperfect numbers (A306983).at n=16A306984
- Least k > 1 such that k^n is a twin rank (cf. A002822: 6*k^n +- 1 are twin primes).at n=29A326230