12310
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22176
- Proper Divisor Sum (Aliquot Sum)
- 9866
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4920
- Möbius Function
- -1
- Radical
- 12310
- Omega Function (Ω)
- 3
- 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
- 156
- 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
- a(n) is the number of partitions of n (the partition numbers).at n=34A000041
- Number of partitions of 4n-1 into n nonnegative integers each no greater than 8.at n=15A001982
- Fibonacci sequence beginning 4, 10.at n=16A022382
- Number of partitions of n into even parts.at n=68A035363
- Earliest sequence where a(a(n))=number of partitions of n.at n=35A038752
- Nonprime partition numbers.at n=27A038753
- Number of partitions satisfying 0 < cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=34A039896
- Number of digits in n-th term of A001387.at n=23A049194
- T(n, k) = S(2n, n, k) for 0<=k<=n and n>=0, where S(p, q, r) is the number of upright paths from (0, 0) to (p, p-q) that do not rise above the line y = x-r.at n=40A050157
- Even partition numbers.at n=15A052001
- Number of ways to partition 2n into positive integers.at n=17A058696
- Number of partitions of Fibonacci(n).at n=9A072214
- Numbers k such that the number of primes between k and 2k (inclusive) is equal to the number of primes between k and reverse(k) (inclusive).at n=26A074814
- Partition numbers of the form 3*k+1.at n=9A087184
- Number of partitions of n-th composite number containing the smallest prime factor: a(n) = A027293(A002808(n), A056608(n)).at n=23A091114
- Number of partitions of n into integers not greater than the squarefree kernel of n.at n=33A098715
- Number of partitions of 3n+1.at n=11A111295
- Concatenation of first n numbers in base 4.at n=3A117640
- Irregular triangle which contains in row n those partition numbers A000041(n*prime(m) + m + 1) which are congruent to 0 mod prime(m) for 1 <= m <= n.at n=10A117749
- Irregular triangle which contains in row n those partition numbers A000041(n*(2m+1) + m + 2) which are congruent to 0 mod (2m+1) for 1 <= m <= n.at n=10A117750