15426
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 33462
- Proper Divisor Sum (Aliquot Sum)
- 18036
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5136
- Möbius Function
- 0
- Radical
- 5142
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 84
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers that are the sum of 11 positive 8th powers.at n=32A003389
- Positive numbers k such that k and 3*k are anagrams in base 7 (written in base 7).at n=23A023069
- Least positive integer coefficients of power series A(x) such that the coefficients of A(x)^2 + A(x) - 1 consist entirely of squares.at n=87A083352
- a(1)=1. a(n) = a(n-1) + sum of the triangular numbers which are among the first (n-1) terms of the sequence.at n=31A100963
- Numbers n such that if n = a U b (where U denotes concatenation) then abs(sigma*(a) - sigma*(b)) = abs(sigma*(n) - n), where sigma*(n) is the sum of the anti-divisors of n.at n=9A239687
- a(n) = Sum_{1 <= j <= n/2, gcd(j,n)=1} j^3.at n=41A295575
- Number of partitions of 2n into distinct parts whose bitwise XOR equals 0.at n=46A307506
- Moran numbers whose arithmetic derivative is also a Moran number (A001101).at n=18A349485
- a(n) = Sum_{k=0..floor(n/3)} binomial(2*(n-3*k),k) * binomial(2*(n-3*k),n-3*k).at n=8A361753
- Number of fixed polyominoids with n cells, allowing right-angled corner-connections and right-angled edge-connections.at n=3A366004