4150
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 7812
- Proper Divisor Sum (Aliquot Sum)
- 3662
- 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
- 1640
- Möbius Function
- 0
- Radical
- 830
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 95
- 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
- Smallest n-th order perfect digital invariant or PDI: smallest number > 1 equal to sum of n-th powers of its digits, or 0 if no such number exists.at n=4A003321
- Numbers that are the sum of 3 positive 5th powers.at n=26A003348
- Numbers that are the sum of at most 3 positive 5th powers.at n=46A004843
- Perfect Digital Invariants: numbers that are the sum of some fixed power of their digits.at n=15A023052
- Concatenation of n and n + 9 or {n,n+9}.at n=40A032614
- Numbers whose set of base-11 digits is {1,3}.at n=25A032918
- Multiplicity of highest weight (or singular) vectors associated with character chi_24 of Monster module.at n=34A034412
- Dirichlet convolution of phi(n) with Bell numbers.at n=8A034767
- Numbers whose base-16 representation has exactly 4 runs.at n=35A043677
- Fixed points for operation of repeatedly replacing a number with the sum of the fifth power of its digits.at n=2A052464
- a(n) = Sum_{k=1..n, gcd(n,k) = 1} k^2.at n=24A053818
- 5th-order digital invariants: the sum of the 5th powers of the digits of n equals some number k and the sum of the 5th powers of the digits of k equals n.at n=1A072896
- a(n) = 1^n + 4^n + 5^n.at n=5A074511
- Satisfies a(n)/A079159(n) = p_n, the n-th prime (n>0), a(0)=1.at n=23A079161
- Sum of the sides of ordered 2 prime sided prime triangles.at n=41A105092
- Numbers k > 0 such that (10's complement factorial of k) + 1 is prime.at n=18A109616
- Sums of squared terms in rows of triangle A114176.at n=5A114179
- Numbers n whose reverse binary representation has the following property: let a 0 mean "halving" and a 1 mean "k -> 3k+1". The number describes an operation k -> f_n(k). If the equation f_n(k) = k has an integer solution, n is a term in the sequence.at n=25A125754
- Numbers n whose reverse binary representation has the following property: let a 0 mean "halving" and a 1 mean "k -> 3k+1". The number describes an operation k -> f_n(k). If the equation f_n(k) = k has a positive integer solution, n is a term in the sequence.at n=11A125756
- Number of polyenes with 2n carbon atoms.at n=9A135527