13233
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19296
- Proper Divisor Sum (Aliquot Sum)
- 6063
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8000
- Möbius Function
- -1
- Radical
- 13233
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 45
- 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
- no
- Odd
- yes
Appears in sequences
- exp(arctan(arctanh(x)))=1+x+1/2!*x^2+1/3!*x^3+1/4!*x^4+9/5!*x^5...at n=9A012231
- sinh(arctan(arctanh(x)))=x+1/3!*x^3+9/5!*x^5+281/7!*x^7+13233/9!*x^9...at n=4A012234
- Positive numbers k such that k and 2*k are anagrams in base 4 (written in base 4).at n=31A023059
- a(n) = floor(e^n mod n^e).at n=44A066433
- Number of partitions of n with designated summands.at n=23A077285
- a(n) = A078153(2^n).at n=11A078158
- A000012 * A122890.at n=43A135722
- Concatenation of n and n-th Fibonacci number.at n=12A139113
- 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, 0), (-1, -1, 1), (-1, 1, -1), (1, 0, 1)}.at n=11A148060
- Riordan array (f(x), x*g(x)), f(x) is the g.f. of A126952, g(x) is the g.f. of A117641.at n=47A171243
- Numbers such that Liouville's function (A002819) and the little omega analog to Liouville's function (A174863) are equal.at n=41A224987
- 27-gonal numbers: a(n) = n*(25*n-23)/2.at n=33A255186
- Number of subsets of {1,2,...,n} such that no two elements differ by 1, 2, 3, or 5.at n=31A375185
- a(n) = Sum_{k=0..n} 9^(n-k) * binomial(n+k-1,k) * binomial(k/3,n-k).at n=6A378555