4154
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6528
- Proper Divisor Sum (Aliquot Sum)
- 2374
- 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
- 1980
- Möbius Function
- -1
- Radical
- 4154
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 64
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = Sum_{k = 1..n} k*floor((n + prime(k))/k).at n=38A024929
- Number of ways to partition n elements into pie slices of different sizes other than one.at n=34A032155
- Numbers k such that the decimal part of k^(1/9) starts with a 'nine digits' anagram.at n=1A034284
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+1 or 24k-1. Also number of partitions in which no odd part is repeated, with no part of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=53A036029
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = a(3) = 1.at n=13A049934
- Handsome numbers (A007532) representable as a sum of any positive powers of their digits in two distinct ways, not counting different powers of duplicated digits as distinct.at n=30A050240
- Numbers k such that k^10 == 1 (mod 11^3).at n=32A056085
- n*M127 - 1 is prime, where M127 = 2^127 - 1.at n=38A057441
- McKay-Thompson series of class 20F for Monster.at n=18A058555
- a(n) = n-th squarefree number beginning with n.at n=40A077687
- a(n) = (5*n+2)*(5*n+7).at n=12A085036
- Numbers k such that k!!!!! - 1 is prime.at n=47A085149
- Non-palindromic n and its digit reversal have the same sum of prime factors (with repetition).at n=14A085607
- Numbers k such that the numerator of Bernoulli(2k) is divisible by the square of 67, the third irregular prime.at n=3A093059
- Numbers k such that k^2+1 and (k+2)^2+1 are both prime; twin k^2+1 primes.at n=39A096012
- 0*9, 1*8, 2*7, 3*6, 4*5; 10*19, 11*18, ..., 14*15; 20*29, 21*28, ..., 24*25; 30*39, ...at n=32A096229
- Number of distinct products i*j*k*l for 1 <= i < j < k < l <= n.at n=26A100438
- Number of partitions of n into parts free of odd squares and the only number with multiplicity in the unrestricted partitions is the number 2.at n=50A100926
- Triangular matchstick numbers in the class of prime numbers: sum of n-th and next n primes.at n=24A105720
- {Sum of all k-digit numbers > n }-{sum of all k-digit numbers < n}, n is a 'k'digit number.at n=28A109644