8351
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9552
- Proper Divisor Sum (Aliquot Sum)
- 1201
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7152
- Möbius Function
- 1
- Radical
- 8351
- 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
- 233
- 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
- Expansion of 1/((1-x)^3 (1-x^2)^2 (1-x^3) (1-x^4)).at n=19A002626
- If x and y are terms, so is x*y + 9.at n=39A009350
- a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) contained in the digits of a(n+1)^2, with a(0)=1.at n=16A014563
- a(n) = [ a(n-1)/a(1) + a(n-2)/a(2) + ... + a(1)/a(n-1) ], for n >= 3.at n=22A022875
- Numbers k such that Fib(k) == -13 (mod k).at n=31A023167
- a(n) = self-convolution of row n of array T given by A027023.at n=7A027040
- Numbers k such that k divides the (left) concatenation of all numbers <= k written in base 15 (most significant digit on right and removing all least significant zeros before concatenation).at n=12A029532
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 91.at n=5A031589
- Digitally balanced numbers in both bases 2 and 3.at n=4A049361
- Numbers k such that A055079(k) = 2^k.at n=23A057838
- Numbers n such that n and the n-th prime have the same digits.at n=25A074350
- Least non-balanced x (i.e., not in A020492) such that sigma(2n-1,x)/phi(x) is an integer.at n=17A078539
- Least non-balanced x (i.e., not in A020492) such that sigma(p(n),x)/phi(x) is an integer, where p(n) = n-th prime.at n=11A078540
- a(n) = floor(11^n/9^n).at n=45A094997
- Numbers n such that the partition function A000041(k) is even and odd the same number of times for 0 <= k <= n.at n=38A098936
- Number of gap-free compositions of n.at n=14A107428
- Lesser of twin simili-primes of order 2.at n=32A126699
- a(n) = 3*a(n-1)+n if a(n-1) is not divisible by 2, or a(n) = a(n-1)/2 otherwise.at n=68A135294
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 1), (-1, 0), (1, 0)}.at n=10A151261
- a(n) = 288*n - 1.at n=28A157997