11849
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 12894
- Proper Divisor Sum (Aliquot Sum)
- 1045
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10880
- Möbius Function
- 0
- Radical
- 697
- Omega Function (Ω)
- 3
- 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
- 99
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n^2*(5*n-3)/2.at n=17A006597
- Least k such that first k terms of A022300 contain n more 2's than 1's.at n=14A025515
- Composite numbers k, not a power of 2, such that the E(k) == 1 (mod k), where E(k) is the k-th Euler number (A000364).at n=34A035163
- Offsets for the Atkin Partition Congruence theorem.at n=47A036492
- Numbers whose base-5 representation contains exactly three 3's and three 4's.at n=1A045307
- Number of rooted trees with n nodes with every leaf at the same height.at n=21A048816
- Integers that are Rhonda numbers to base 12.at n=9A100971
- Riordan array (1/(1-xc(2x)),xc(2x)/(1-xc(2x))), c(x) the g.f. of A000108.at n=30A110506
- a(n) = 104*n + 9977.at n=18A126978
- Primitive subsequence of A111105.at n=22A137559
- 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, -1, -1), (-1, -1, 1), (-1, 0, 1), (-1, 1, 0), (1, 0, 0)}.at n=10A148510
- Positive numbers y such that y^2 is of the form x^2+(x+449)^2 with integer x.at n=6A159589
- Totally multiplicative sequence with a(p) = 8p+1 for prime p.at n=19A166666
- a(n) = n*(21*n-17)/2.at n=34A226491
- Primitive antiharmonic numbers.at n=46A228023
- Number of partitions of n such that the number of parts having multiplicity 1 is a part and the number of distinct parts is not a part.at n=39A241444
- 4*(n + 7)^3 - 27*(n + 7)^2 = (4*n +1)*(n+7)^2.at n=10A245033
- a(n) = 4*prime(n)^3 - 27*prime(n)^2 = (prime(n)^2)*[4*prime(n) - 27], n >= 4.at n=3A245036
- Numbers k such that the sum of the divisors of k is divisible by the number of divisors of k, and the sum of the squares of the divisors of k is divisible by the sum of the divisors of k.at n=31A277553
- The number of trees with 5 nodes labeled by positive integers, where each tree's label sum is n.at n=20A301740