14754
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 29520
- Proper Divisor Sum (Aliquot Sum)
- 14766
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4916
- Möbius Function
- -1
- Radical
- 14754
- 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
- 102
- 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
- yes
- Odd
- no
Appears in sequences
- Number of partitions of floor(7n/2)-1 into n nonnegative integers each no greater than 7.at n=19A001980
- Number of integer points (x,y,z) at distance <= 0.5 from sphere of radius n.at n=34A016728
- a(1) = 1, a(n+1) is the sum of a(n) and floor( arithmetic mean of a(1) ... a(n) ).at n=39A065094
- Number of basis partitions of n+100 with Durfee square size 10.at n=23A069253
- a(n) = smallest m >= 1 such that Sum_{k=1..m} log(k)/k >= n.at n=46A092753
- Self-convolution of A092684.at n=13A100938
- a(n) is the maximal positive integer m for which exponents of prime(n) and prime(n+1) in the prime power factorization of m! are both powers of 2.at n=46A177498
- Numbers n such that 14*3^n + 1 is prime.at n=27A216890
- Numbers k such that Sum_{i=1..k} sigma(i)^d(i) == 0 (mod k), where sigma = A000203 and d = A000005.at n=14A260654
- G.f.: Product_{i>=1, j>=1, k>=1} (1 + x^(i*j*k)).at n=18A280473
- Numbers that are the sum of 4 nonzero 4th powers in more than one way.at n=29A309763
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=7A318019
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=47A318024
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=52A318024
- Numbers k such that k divides the sum of digits in primorial base of all numbers from 1 to k.at n=32A333703
- Numbers that are the sum of four fourth powers in exactly two ways.at n=29A344193
- Expansion of e.g.f. 1/(1 - 3*x)^(x/3).at n=6A354310