14949
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23712
- Proper Divisor Sum (Aliquot Sum)
- 8763
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9000
- Möbius Function
- 0
- Radical
- 4983
- 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
- 102
- 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
- Divisors of 2^30 - 1.at n=42A003538
- Number of balanced partitions of n: the largest part equals the number of parts.at n=52A047993
- a(n) = binomial(n+5,4) - 1.at n=21A063258
- t(n^2) is a square and sets a new record for such squares, where t(n) = (sigma(n)-n)*omega(n); or t(n)= A001065(n)*A001221(n).at n=9A063777
- a(n) = Sum_{i=1..n} floor((3/2)^i).at n=20A066778
- Triangular Kaprekar-like numbers: numbers k such that the base-10 representation of T(k) = k*(k+1)/2 is the concatenation of two numbers x and y such that x + y = k.at n=32A110939
- Moebius transform of binomial(n+3, 4).at n=22A117109
- Numerator of sum of reciprocals of first n 5-simplex numbers A000389.at n=21A118431
- Numbers k which divide the sum of the Fibonacci numbers F(1) through F(k) and such that k is not a multiple of 24.at n=18A124456
- Numbers k whose last k digits of k^k form a prime number.at n=4A126703
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 1000-1100-0111-0100 pattern in any orientation.at n=11A147157
- a(n) = n^3 - (n+1)^2.at n=25A153257
- Number of lattice paths from (0,0) to (n,n) using steps S={(k,0),(0,k),(1,1)|0<k<=2} which never go above the line y=x.at n=6A175895
- Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any element within a city block distance of two, and containing the value n(n+1)/2-4.at n=4A212041
- T(n,k)=Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any element within a city block distance of two, and containing the value n(n+1)/2-k-1.at n=25A212044
- Numbers k such that 3^k - 32 is prime.at n=15A219049
- Number of n X 7 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 n X 7 array.at n=12A219501
- Number of partitions of n having standard deviation σ <= 2.at n=45A238659
- Irregular triangle read by rows: T(n,k) = number of unsigned unichromosonal genomes with n genes at 4-break distance k from a fixed genome, 0 <= k <= floor((n+1)/3).at n=22A264616
- Integers x with h+1 digits that have the property that there exists an integer k, with x <= k < 2*x, such that k/x = 1 + (x-10^h)/(10^h-1), i.e., the same digits appear in the denominator and in the recurring decimal.at n=13A288781