13032
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 35490
- Proper Divisor Sum (Aliquot Sum)
- 22458
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 0
- Radical
- 1086
- Omega Function (Ω)
- 6
- 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
- 45
- 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
- Expansion of cos(log(1+x)*cos(x)).at n=9A009028
- Expansion of log(1+log(1+x))*cos(x).at n=7A009313
- Positive numbers k such that k and 2*k are anagrams in base 4 (written in base 4).at n=28A023059
- Theta series of lattice A_2 tensor D_3 (dimension 6, det. 432, min. norm 4).at n=38A033701
- Determinant of n X n Hankel matrix whose entries are t(i+j), 0 <= i, j < n, where t is the Thue-Morse sequence.at n=29A056887
- Numbers k such that phi(x) = k has exactly 12 solutions.at n=41A060675
- Convolution of Fibonacci F(n+1), n>=0, with F(n+7), n>=0.at n=10A067430
- a(n) = 2*(n-1)*(n^2 + 1).at n=18A071233
- Sum of terms in n-th row of A077164.at n=23A077167
- a(1) = 1, a(n) = a(n-1)*n if n is composite, a(n) = a(n-1) + n if n is a prime.at n=8A083525
- Triangle T(n,k) read by rows, where T(n,k) = number of times the permanent of a real n X n (0,1)-matrix takes the value k, for n >= 0, 0 <= k <= n!.at n=15A089479
- Triangle T(n,k) read by rows, where T(n,k) = number of times the permanent of a real nonsingular n X n (0,1)-matrix takes the value k, for n >= 1, 1 <= k <= A000255(n).at n=5A089480
- Number of real {0,1}-matrices having permanent = 1.at n=4A089482
- Period of the Lucas 5-step sequence A074048 mod n.at n=18A106297
- Period of the Lucas 5-step sequence A074048 mod n.at n=37A106297
- Period of the Lucas 5-step sequence A074048 mod prime(n).at n=7A106298
- Period of the Fibonacci 5-step sequence A001591 mod n.at n=18A106303
- Period of the Fibonacci 5-step sequence A001591 mod n.at n=37A106303
- Period of the Fibonacci 5-step sequence A001591 mod prime(n).at n=7A106304
- Values of n such that (sigma(sigma(n))-phi(phi(n)))/n is an integer (the corresponding integral ratios are given in A136132).at n=22A136131