14736
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 38192
- Proper Divisor Sum (Aliquot Sum)
- 23456
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4896
- Möbius Function
- 0
- Radical
- 1842
- Omega Function (Ω)
- 6
- 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
- 133
- Smith Number
- yes
- 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
- Positive numbers k such that k and 2*k are anagrams in base 8 (written in base 8).at n=30A023073
- a(n) = n! * (1 + Sum_{j=1..n} (-1)^j/j).at n=8A024168
- Number of ternary Lyndon words whose digits sum to 0 mod 3; also number of trace 0 irreducible polynomials over GF(3).at n=11A046209
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,5.at n=27A064239
- Numbers n such that n and 2^n end with the same three digits.at n=14A067866
- Number of permutations on n letters that have only cycles of length 4 or less.at n=8A070945
- Number of elements in the coprime subsets of the integers 1 to n.at n=19A087080
- G.f.: A(x) = exp( Sum_{n>=1} A056045(n)/n*x^n ), where A056045(n) = Sum_{d|n} binomial(n,d).at n=18A110448
- McKay-Thompson series of class 36b for the Monster group.at n=43A112173
- Numbers n with property that n^2 is a sum of some 70 successive primes.at n=22A166256
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) >= number of parts of p.at n=44A241831
- The 300-degree spoke (or ray) of a hexagonal spiral of Ulam.at n=35A244804
- Number of length 1+2 0..n arrays with no three consecutive terms having the sum of any two elements equal to twice the third.at n=23A248462
- a(n) = Sum_{k=0..n} k*A000009(k).at n=24A270105
- Numbers k such that the decimal number concat(4,k) is a square.at n=33A273359
- a(n) = n!*Sum_{k=0..n} binomial(2*n,n-k)*n^k/k!.at n=4A295385
- a(n) is the first Zagreb index of the Lucas cube Lambda(n).at n=11A307181
- Number of odd parts in the partitions of n into 8 parts.at n=40A309628
- Sum of the sixth largest parts of the partitions of n into 9 parts.at n=43A326468
- Triangle read by rows where T(n,k) is the number of labeled simple graphs with n vertices and spanning edge-connectivity k.at n=22A327069