12419
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13560
- Proper Divisor Sum (Aliquot Sum)
- 1141
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11280
- Möbius Function
- 1
- Radical
- 12419
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 156
- 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) = n*(7*n^2 - 1)/6.at n=22A004126
- Number of days in n years (n=2 is the first leap year).at n=33A033173
- Number of days in n years (n=1 is the first leap year).at n=33A033174
- Base 8 palindromes that start with 3.at n=20A043023
- Numbers k such that 271*2^k-1 is prime.at n=7A050894
- Numbers k such that A055079(k) = 2^k.at n=27A057838
- Stirling2 transform of [2,3,3,3,3,3,3,3,...].at n=7A060996
- Antidiagonal sums of table A083362.at n=28A083364
- Antidiagonal sums of A086272 (and of A086273).at n=21A086274
- a(n)=60*sum(1<=i<=j<=k<=n,i*j^2/k).at n=5A088943
- a(n) = 6*n*(n-1) - 1.at n=46A103115
- Expansion of c(x^2+x^3), c(x) the g.f. of A000108.at n=16A115178
- 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, 0, 1), (0, 1, -1), (1, -1, 1), (1, 1, 0)}.at n=8A149288
- Number of 0..4 arrays x(0..n-1) of n elements with nondecreasing average value.at n=8A200760
- T(n,k)=Number of nXk 0..4 arrays with every row and column running average nondecreasing rightwards and downwards.at n=36A200858
- Numerators in the resistance triangle: T(k,n)=b, where b/c is the resistance distance R(k,n) for k resistors in an n-dimensional cube.at n=51A212045
- Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 5 6 or 8 and every 3X3 diagonal and antidiagonal sum equal to 0 3 5 6 or 8.at n=4A252346
- Number of (n+2)X(5+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 5 6 or 8 and every 3X3 diagonal and antidiagonal sum equal to 0 3 5 6 or 8.at n=1A252349
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 5 6 or 8 and every 3X3 diagonal and antidiagonal sum equal to 0 3 5 6 or 8.at n=16A252352
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 5 6 or 8 and every 3X3 diagonal and antidiagonal sum equal to 0 3 5 6 or 8.at n=19A252352