5025
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
- 12
- Divisor Sum
- 8432
- Proper Divisor Sum (Aliquot Sum)
- 3407
- 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
- 2640
- Möbius Function
- 0
- Radical
- 1005
- Omega Function (Ω)
- 4
- 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
- 116
- 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
- Number of points of norm <= n^2 in square lattice.at n=40A000328
- Coordination sequence T4 for Zeolite Code RSN.at n=46A009888
- Discriminants of quintic fields with 4 complex conjugates.at n=26A023685
- a(n) = position of 3*n^2 in sequence A025051 (numbers of form j*k + k*i + i*j, without repetitions, where 1 <= i <= j <= k).at n=40A025056
- Numbers having period-4 6-digitized sequences.at n=24A031197
- a(n) = n-th prime number * n-th lucky number.at n=18A032601
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/11) starts with n.at n=17A034076
- T(n,n-3), array T as in A038792.at n=31A038793
- A convolution triangle of numbers obtained from A034687.at n=33A049375
- Number of partitions into at most a(1) copies of 1, a(2) copies of 2, ...at n=42A052337
- n is odd and sum of digits of n equals the numbers of divisors of n.at n=26A057532
- Numbers k such that k and its reversal are both multiples of 15.at n=8A062905
- Non-palindromic number and its reversal are both multiples of 15.at n=4A062914
- Primitive subsequence of A066031: terms of A066031 which are not a multiple of some previous terms.at n=38A064623
- Smallest k not a palindrome and not divisible by 10 such that k and R(k) both are divisible by n, or 0 if n is divisible by 10.at n=14A075606
- Numbers k such that A068340(k)=+/-4.at n=5A077032
- Expansion of (5 - 9*x + 6*x^2)/(1-x)^4.at n=24A080957
- Fourth row of Pascal-(1,3,1) array A081578.at n=8A081586
- Total number of elements in all subsets of {1,2,..,n} with relatively prime elements.at n=9A085948
- Satisfies Sum_{n>=0} a(n)*x^n/n! = log(f(x)) = series reversion of x*f(x), where f(x*f(x)) = exp(x) and f(x) = Sum_{n>=0} A087961(n)*x^n/n!.at n=5A087962