14527
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14800
- Proper Divisor Sum (Aliquot Sum)
- 273
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14256
- Möbius Function
- 1
- Radical
- 14527
- Omega Function (Ω)
- 2
- 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
- 71
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Decimal part of cube root of a(n) starts with 4: first term of runs.at n=23A034130
- a(1) = a(2) = 1; for n>2, a(n) = 4*a(n-1) + 3*a(n-2).at n=7A086901
- Expansion of 1/(sqrt(1+4x^2)+x(1-x)).at n=19A111964
- Ceiling(4*Pi*n^2).at n=33A135971
- Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,2,1,1,1 for x=0,1,2,3,4.at n=11A197540
- Number of n X 5 arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 n X 5 array.at n=21A220029
- Number of (n+1)X(5+1) 0..2 arrays with every 2X2 subblock having the absolute values of all six edge and diagonal differences no larger than 1.at n=0A234119
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the absolute values of all six edge and diagonal differences no larger than 1.at n=10A234122
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the absolute values of all six edge and diagonal differences no larger than 1.at n=14A234122
- Number of (4+2)X(n+2) 0..4 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=10A252965
- G.f.: Product_{k>=1} 1/(1-x^k)^(4*k).at n=8A255611
- Number of length n+3 0..1 arrays with at most two downsteps in every n consecutive neighbor pairs.at n=14A256818
- Numbers k such that 5*10^k - 81 is prime.at n=21A281512
- Number of total dominating sets in the n-barbell graph.at n=6A302761
- Nearest integer to 4*Pi*n^2.at n=34A322615
- The sequence denoted by j_n used in the calculation of A323260.at n=10A323264
- Denominator of relativistic sum w(2n) of the velocities v = 1/p^(2n) over all primes p, in units where the speed of light c = 1.at n=3A348830
- Numbers k such that both Sum_{i=1..k} i*prime(i) and Sum_{i=1..k} (k+1-i)*prime(i) are prime.at n=24A356178
- Position of first 0 in the n-th differences of the noncomposite numbers (A008578), or 0 if it does not appear.at n=15A376855
- a(n) is the maximum integer for which some minimum-length sum equaling a(n) of perfect squares less than n^2 excludes (n-1)^2.at n=26A377084