14789
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15456
- Proper Divisor Sum (Aliquot Sum)
- 667
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14124
- Möbius Function
- 1
- Radical
- 14789
- 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
- 40
- 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
- a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), where m = floor((n+2)/2), T given by A027948.at n=13A027958
- Numbers having four 2's in base 9.at n=18A043464
- Numbers whose base-11 representation has exactly 5 runs.at n=14A043648
- A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the ratios of six simple musical tones: 8/7 5/4 4/3 3/2 8/5 7/4.at n=40A060526
- a(n) = A077698(n+1)/A077698(n).at n=20A077699
- a(n) = 8*n^2 - 3.at n=42A108928
- a(n) = n^3 + 114 * n.at n=22A122562
- a(n) = floor(log(Fibonacci(prime(k))/prime(k))), where k = A119984(n).at n=27A134791
- a(n) = round(log(Fibonacci(prime(k))/prime(k))), where k = A119984(n).at n=27A134792
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (-1, 1, 0), (1, 0, -1), (1, 0, 0)}.at n=11A148058
- Numbers n such that 41#*2^n-1 is prime, where # denotes the primorial, A002110.at n=72A176061
- Number of derangements of {1,2,...,n} having no adjacent 4-cycles (an adjacent 4-cycle is a cycle of the form (i,i+1,i+2,i+3)).at n=8A177260
- Floor(r*a(n-1)) + floor(r*a(n-2)), where r = 5/2, a(0) = 1, a(1) = 1.at n=9A275863
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 454", based on the 5-celled von Neumann neighborhood.at n=13A282307
- Strings of 5 digits from 1...9, such that no formula using the single digits in the given order exists that evaluates to 0.at n=21A288355