5436
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 13832
- Proper Divisor Sum (Aliquot Sum)
- 8396
- 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
- 1800
- Möbius Function
- 0
- Radical
- 906
- Omega Function (Ω)
- 5
- 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
- 67
- 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
- a(0) = 7, a(1) = 9; for n >= 0, a(2n+1) = a(2n-1)^2 - a(2n-2), a(2n+2) = a(2n)^2 - a(2n+1).at n=5A007449
- Number of terms in n-th derivative of a function composed with itself 5 times.at n=10A022813
- a(n) = n * prime(n).at n=35A033286
- Number of partitions of n into parts not of form 4k+2, 16k, 16k+5 or 16k-5.at n=48A036022
- Conjecturally, a power of 2 written in base 3 cannot have this many 2's.at n=40A036463
- Matrix 5th power of partition triangle A008284.at n=45A039807
- Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; ...; each k is an R(i(k),j(k)) and A057040(n)=i(F(n)), where F(n) is the n-th Fibonacci number.at n=35A057040
- Numbers k such that phi(x) = k has exactly 9 solutions.at n=28A060672
- z such that the Diophantine equation x^3+y^4=z^3 has solutions.at n=39A070741
- Sum of terms in n-th row of A077316.at n=17A077318
- Related to tennis ball problem.at n=2A079519
- Arises from a social choice theory problem. Sequence is a transformation of the number of non-transitive quasitransitive distinct profiles with 3 alternatives and strict individual preferences.at n=4A082677
- Pseudo-random numbers: MS C 6.0 version.at n=19A084275
- Third column of A071223.at n=11A087645
- Numbers n such that n and the four successive integers produce primes if substituted for x in the polynomial 5x^2+5x+1. See A090562, A090563. Terms show that longer similar chains also exist.at n=11A090100
- Number of partitions of 2n prime to 3,5 with all odd parts occurring with even multiplicities. There is no restriction on the even parts.at n=29A103259
- Least multiple of prime(n) ending in digits of n.at n=32A114012
- Number of 2 X 2 symmetric matrices over Z(n) having nonzero determinant.at n=17A115077
- Numbers k such that 3*k^k-1 is prime.at n=4A118305
- a(1)=4; a(n) = floor((31+Sum_{i=1..n-1} a(i))/7).at n=54A120189