14739
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20880
- Proper Divisor Sum (Aliquot Sum)
- 6141
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9248
- Möbius Function
- 0
- Radical
- 51
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- 45
- 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
- Numbers n such that n | 11^n + 10^n + 9^n + 8^n + 7^n + 6^n.at n=25A057258
- Zero, together with positive numbers k such that prime(k) - k is a square.at n=42A064370
- G.f. A(x) satisfies: A(x*G098618(x)) = G098618(x), where G098618 is the g.f. for A098618(n) = A007482(n)*Catalan(n).at n=7A098619
- Integers that are Rhonda numbers to base 8.at n=5A100970
- Composite numbers whose exponents in their canonical factorization lie in the geometric progression 1, 3, 9, ...at n=15A102838
- a(n) = 3*n^3.at n=17A117642
- a(n) = n^3/6 + 3*n^2/4 + 7*n/3 + 7/8 + (-1)^n/8.at n=43A173154
- (A178476(n)-3)/9.at n=29A178486
- Numbers n with property that the largest proper divisor of n is a cube.at n=32A187104
- Smallest possible largest number in a 3 by n average array where repetitions are allowed with diagonals.at n=10A195630
- Number of (n+1) X 5 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to the number of counterclockwise edge increases.at n=0A209513
- T(n,k) = Number of (n+1) X (k+1) 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to the number of counterclockwise edge increases.at n=6A209517
- T(n,k) = Number of (n+1) X (k+1) 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to the number of counterclockwise edge increases.at n=9A209517
- Composite numbers k such that Sum_{i=1..t-1} d(i+1)/d(i) is prime, where d(1), ..., d(t) are the divisors of k in ascending order.at n=22A255585
- Numbers of the form p * q^p where p and q are primes, in increasing order.at n=32A257404
- Primitive values n such that the square with opposite corners (0,0) and (n,n) contains a point (x,y) with integer coordinates, with 0 < x,y < n, at an integer distance from three of the four corners.at n=25A260549
- A(n,k) is the n-th Rhonda number to base A002808(k), the k-th composite number; square array A(n,k), n>=1, k>=1, read by antidiagonals.at n=33A291925
- Numbers k such that 6*10^(2*k) + 6*10^k + 1 is prime.at n=7A309741
- Number of pairwise coprime strict compositions of n, where a singleton is always considered coprime.at n=44A337562
- Number of compositions (ordered partitions) of n into an odd number of cubes.at n=53A339421