11840
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 28
- Divisor Sum
- 28956
- Proper Divisor Sum (Aliquot Sum)
- 17116
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 0
- Radical
- 370
- Omega Function (Ω)
- 8
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 50
- 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
- Number of partitions of n into parts not of the form 19k, 19k+7 or 19k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=35A035976
- Numbers k that can be expressed as k = w + x = y*z with w*x = y^3 + z^3 where w, x, y, and z are all positive integers.at n=28A057372
- Even numbers n such that 37^2 (the square of the first irregular prime) divides the numerator of Bernoulli(n).at n=21A090789
- Numbers n such that 8*10^n + 5*R_n + 4 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=18A103086
- a(0)=a(1)=a(2)=a(3)=a(4)=a(5)=1; a(n)=a(n-1)+a(n-2)-a(n-4)+a(n-6) for n>=6.at n=27A109537
- a(n) = floor(log(A111288(n))).at n=29A111388
- Numbers with 28 divisors.at n=35A137491
- 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, 0, 0), (1, 0, 0), (1, 0, 1), (1, 1, 0), (1, 1, 1)}.at n=6A151254
- The number of permutations avoiding simultaneously consecutive patterns 213 and 231.at n=9A173940
- a(1)=1. a(n) = A005179(d(a(n-1))) + a(n-1), where d(n) = the number of divisors of n, and A005179(n) is the smallest positive integer with exactly n divisors.at n=45A175300
- Products of the 6th power of a prime and 2 distinct primes (p^6*q*r).at n=32A179672
- Distance from Fibonacci(n) to the next perfect square.at n=38A216223
- Compositions with subdiagonal growth: number of compositions (p0, p1, p2, ...) of n with pi - p0 <= i.at n=15A238859
- Number of partitions p of n such that (number of numbers in p of form 3k) = (number of numbers in p of form 3k+1).at n=41A241744
- Numbers n with property that A062234(n) = A062234(n+1) = A062234(n+2) = A062234(n+3).at n=9A257892
- Composites whose prime factorization in base 3 is an anagram of the number in base 3.at n=24A260047
- a(n) is the smallest number which has a water-capacity of n.at n=31A275339
- Number of Dyck paths of semilength n such that each level has exactly three peaks or no peaks.at n=14A288110
- Number T(n,k) of permutations p of [n] such that in 0p the largest up-jump equals k and no down-jump is larger than 2; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=63A291680
- Number of permutations p of [n] such that in 0p the largest up-jump equals eight and no down-jump is larger than 2.at n=2A321115