1411
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1512
- Proper Divisor Sum (Aliquot Sum)
- 101
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1312
- Möbius Function
- 1
- Radical
- 1411
- 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
- 34
- 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
- Numbers k such that 9*2^k + 1 is prime.at n=23A002256
- a(n) = a(n-2) + a(n-3), with a(0) = 0, a(1) = 1, a(2) = 4.at n=25A007309
- Coordination sequence T3 for Zeolite Code CAS.at n=23A008065
- Coordination sequence T3 for Zeolite Code MTT.at n=23A008191
- Composite but smallest prime factor >= 17.at n=51A008367
- Shallit sequence S(14,23), a(n)=[ a(n-1)^2/a(n-2)+1 ].at n=9A010923
- Discriminants of imaginary quadratic fields with class number 4 (negated).at n=50A013658
- Pseudoprimes to base 84.at n=6A020212
- Numbers k such that the continued fraction for sqrt(k) has period 18.at n=43A020357
- Fibonacci sequence beginning 3, 14.at n=11A022125
- Describe previous term from the right (method A - initial term is 4).at n=2A022508
- Self-convolution of (1, p(1), p(2), ...).at n=12A023626
- Index of 10^n within the sequence of the numbers of the form 6^i*10^j.at n=46A025744
- a(n) = dot_product(n,n-1,...2,1)*(5,6,...,n,1,2,3,4).at n=12A026060
- Number of partitions of n in which the least part is 8.at n=74A026801
- Number of partitions of 4^n-1 into n-th powers.at n=7A027600
- a(n) = n^2 + n + 5.at n=37A027690
- Numbers that have only the straight digits {1, 4, 7}.at n=48A028373
- Positions of records in A030707.at n=35A030712
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 37.at n=3A031535