8130
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 19584
- Proper Divisor Sum (Aliquot Sum)
- 11454
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2160
- Möbius Function
- 1
- Radical
- 8130
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 127
- 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
- yes
- Odd
- no
Appears in sequences
- a(n)^2 is the least square base-n doublet (base-n representation is the concatenation of 2 identical strings).at n=27A020339
- Coordination sequence for root lattice B_5.at n=4A022147
- [ exp(11/23)*n! ].at n=6A030818
- Least term in period of continued fraction for sqrt(n) is 6.at n=37A031430
- Sum of the lengths of the cycle types of the permutation created by duality and reversal on the partitions of n.at n=31A036050
- Numbers which have more different digits than their squares.at n=40A061277
- Largest squarefree number dividing sum of cubes of divisors of n.at n=28A080238
- A unitary phi reciprocal amicable number: consider two different numbers r, s which satisfy the following equation for some integer k: uphi(r) = uphi(s) = (1/k) * r * s / (r-s); or equivalently, 1/uphi(r) = 1/uphi(s) = k * (1/s - 1/r); sequence gives k numbers.at n=36A080768
- Positions where values change in A100144.at n=45A100250
- Square array A(n,k) read by antidiagonals: coordination sequence for lattice B_n.at n=32A103883
- Square array, read by antidiagonals, where row n equals the coordination sequence of B_n lattice, for n >= 0.at n=49A108998
- Numbers n such that the numerator of Sum_{k=0..n} 1/k!, in reduced form, is prime.at n=18A109621
- Number of Fibonacci binary words of length n having no 0110 subword. A Fibonacci binary word is a binary word having no 00 subword.at n=21A130137
- a(n) = ceiling(n^3/3).at n=29A131477
- a(n) = (prime(n)^2 + prime(n+1))/2.at n=29A140511
- a(n) = 9*n^2 + n.at n=29A154517
- a(n) = 36*n^2 + 2*n.at n=14A158064
- a(n) = 900*n^2 + 30.at n=3A158672
- 5 times centered pentagonal numbers: 5*(5*n^2 + 5*n + 2)/2.at n=25A164015
- Numbers n such that Sum(n!/k!),k=0..n is prime.at n=4A166339