14490
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 44928
- Proper Divisor Sum (Aliquot Sum)
- 30438
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3168
- Möbius Function
- 0
- Radical
- 4830
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 5
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 71
- 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
- yes
- Odd
- no
Appears in sequences
- Number of walks on cubic lattice.at n=41A005570
- Numbers k such that k^6 + 1091 is prime.at n=9A066386
- Composite numbers requiring increasingly larger bases to become prime by base reversal.at n=20A075243
- Numbers n such that 2*n*k(n) is rational but not an integer, where k(n) is sum of successive remainders when computing the Euclidean algorithm for (1, 1/sqrt(n)) as defined in A086378 (MuPAD program is given there); numbers belonging to A086378 but not to A088900.at n=10A087414
- Least area of primitive Pythagorean triangle whose legs differ by A058529(n).at n=17A094143
- Triangle T, read by rows, that satisfies matrix equation: T - (T-I)^2 = C, where C is Pascal's triangle.at n=40A117269
- Area of primitive Pythagorean triangles sorted on hypotenuse (A020882), then on middle side (or long leg A046087).at n=43A120734
- Triangle read by rows: T(n,k) is the number of paths in the first quadrant from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k U steps (0 <= k <= floor(n/2)).at n=46A132883
- Sums of the products of n consecutive triples of numbers.at n=6A135037
- Numbers m that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (m raised to k+1 must not be a multiple). Case k=16.at n=3A135201
- Composites one larger than a prime, with exactly five distinct prime factors.at n=27A136154
- a(n) = area of Pythagorean triangle with hypotenuse p, where p = A002144(n) = n-th prime == 1 (mod 4).at n=26A145010
- Six times hexagonal numbers: 6*n*(2*n-1).at n=35A152746
- Smallest number which is an unordered sum of two odd abundant numbers in exactly n ways.at n=10A187743
- Numbers with prime factorization pqrst^2.at n=19A189983
- 23 times triangular numbers.at n=35A195039
- Number of 2 X 2 matrices with all elements in {0,1,...,n} and determinant >n.at n=13A210291
- Triangle T(n,k), 0 <= k <= n, given by (0, 1, 0, 2, 0, 3, 0, 4, 0, 5, ...) DELTA (1, 2, 3, 4, 5, 6, 7, 8, 9, ...) where DELTA is the operator defined in A084938.at n=39A211608
- Numbers k such that at least one other integer m exists with the same smallest and same largest prime factors, and same multisets of decimal and binary digits as k.at n=34A214621
- Numbers n such that smallest number not dividing n^2 (A236454) is different from smallest prime not dividing n (A053669).at n=34A235921