14335
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17856
- Proper Divisor Sum (Aliquot Sum)
- 3521
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11040
- Möbius Function
- -1
- Radical
- 14335
- 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
- 195
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = 2*a(n-2) + 1.at n=23A010737
- Divide natural numbers in groups with prime(n) elements and add together.at n=14A034956
- Number of partitions satisfying cn(0,5) + cn(2,5) <= cn(1,5) + cn(4,5) and cn(0,5) + cn(3,5) <= cn(1,5) + cn(4,5).at n=36A039887
- Permutation of N induced by rotating the node 3 right in the infinite planar binary tree shown at A065658.at n=49A065664
- a(n) = 7*2^n - 1.at n=11A086224
- Expansion of (1+2x^2)/(1-x-4x^5).at n=21A098524
- Numbers k such that A109631(k) - A109631(k+1) = A109631(k+2).at n=13A109715
- a(n) is the smallest integer > n that is non-coprime to n and has the same number of 0's in its binary representation as n has.at n=45A145257
- a(n) is the smallest positive integer m with exactly n ones in its binary representation and with n represented in binary as a substring of the binary representation of m.at n=12A147760
- a(n) = 512n - 1.at n=27A158011
- a(n) = 1024*n - 1.at n=13A158421
- a(n) = 14*n^2 - 1.at n=31A158485
- a(n) = 56*n^2 - 1.at n=15A158658
- a(n) = the smallest positive integer that contains the same number of (non-leading) 0's as n when a(n) and n are written in binary, is not coprime to n, and is not a divisor of n.at n=45A161397
- Partial sums of ceiling(Fibonacci(n)/2).at n=21A179018
- a(n) = 14 * 4^n - 1.at n=5A206372
- Triangle of coefficients of polynomials u(n,x) jointly generated with A207630; see the Formula section.at n=44A207629
- Hypotenuse of the smallest Pythagorean triple whose legs are m and 2m + n.at n=46A216260
- Positions of records in A249695.at n=15A249715
- Number of (n+2)X(5+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=19A254904