14883
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 22344
- Proper Divisor Sum (Aliquot Sum)
- 7461
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8800
- Möbius Function
- 0
- Radical
- 1353
- 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
- 133
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) is the number of partitions of n (the partition numbers).at n=35A000041
- Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); sequence gives values of n where |P(n)| sets a new record.at n=36A000099
- a(n) = (4*n+1)*(4*n+3).at n=30A001539
- Nonprime partition numbers.at n=28A038753
- Odd partition numbers.at n=18A052003
- Number of primitive (aperiodic) reversible string structures with n beads using a maximum of three different colors.at n=10A056332
- Number of ways to partition 2n+1 into positive integers.at n=17A058695
- Smallest integer >= 0 of the form x^4 - n^3.at n=36A070928
- Numbers n for which there are exactly twelve k such that n = k + reverse(k).at n=9A072435
- Smallest partition number divisible by n.at n=40A072871
- Number of partitions of n with at least one odd part.at n=35A086543
- Partition numbers of the form 3*k.at n=15A087183
- T(n,k) = number of partitions of binomial(n,k), 0<=k<=n, triangular array read by rows.at n=32A090011
- T(n,k) = number of partitions of binomial(n,k), 0<=k<=n, triangular array read by rows.at n=31A090011
- Smallest partition number with n-th prime as factor.at n=12A091689
- Number of partitions of n into integers not greater than the squarefree kernel of n.at n=34A098715
- Number of partitions of T where T = (3n + 1) if n is even and T=(3n + 1)/2 if n is odd.at n=22A111329
- 3 times octagonal numbers: a(n) = 3*n*(3*n-2).at n=41A152751
- Odd partition numbers of odd numbers.at n=9A154795
- Product of odd prime anti-factors < n, with multiplicity.at n=60A171487