10379
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10584
- Proper Divisor Sum (Aliquot Sum)
- 205
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10176
- Möbius Function
- 1
- Radical
- 10379
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 223
- 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) = (12*n+1)*(12*n+11).at n=8A001538
- Numbers that are the sum of 5 positive 6th powers.at n=45A003361
- a(n)-th prime is sum of first k primes for some k.at n=23A020641
- Number of partitions of n with equal number of parts congruent to each of 2 and 3 (mod 4).at n=44A035545
- a(n) is the smallest composite number c such that A002110(n) + c is prime.at n=24A038771
- Number of anagrams of a(n) that are prime increases.at n=14A046888
- a(n) is the least integer that has exactly n anagrams that are primes.at n=30A046890
- Values of n where number of permutations of digits a(n) that are prime increases.at n=16A046891
- a(n) is the least number with exactly n permutations of digits that are primes.at n=37A046893
- Composite numbers n such that k! == 1 (mod n) for some k > 2.at n=17A049048
- Composite numbers n such that sigma(n+24) = sigma(n) + 24.at n=16A054983
- Primeval numbers: numbers that set a record for the number of distinct primes that can be obtained by permuting some subset of their digits.at n=20A072857
- a(0)=0, a(1)=1, a(2)=1, a(3)=1, a(n) = a(n-3) + a(n-4) for n > 3.at n=49A079398
- Exponential generating function: exp(cosh(x)+2*x-1).at n=8A081558
- a(n) = A083710(n) - A000041(n-1).at n=67A083711
- a(n) = prime(n)*prime(n+3).at n=24A090090
- Numbers k such that if P = 10*k^2+1, then P, P+6, P+12 and P+18 are all primes.at n=31A092446
- a(n) is the smallest integer m such that A039995(m)=n.at n=15A094535
- a(n) is the earliest number m such that n*pi(m)=phi(m).at n=7A097651
- Numbers k such that 2*k+1, 3*k+2 and 4*k+3 are primes.at n=43A126955