7432
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13950
- Proper Divisor Sum (Aliquot Sum)
- 6518
- 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
- 3712
- Möbius Function
- 0
- Radical
- 1858
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- 132
- 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(n) = 3 + n/2 + 7*n^2/2.at n=46A006124
- Royal paths in a lattice.at n=5A006321
- Apply (1+Shift)^3 to Bell numbers.at n=8A011970
- Aitken's array: triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} read by rows, defined by a(0,0)=1, a(n,0) = a(n-1,n-1), a(n,k) = a(n,k-1) + a(n-1,k-1).at n=39A011971
- Sequence formed by reading rows of triangle defined in A011971.at n=31A011972
- a(n) = least 2k such that p is the least prime in a Goldbach partition of 2k, where p = prime(n).at n=22A025017
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = (primes).at n=17A025098
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 21.at n=34A031519
- Triangular array read by rows associated with Schroeder numbers: T(1,k) = 1; T(n,k) = 0 if k < n; T(n,k) = T(n,k-1) + T(n-1,k-1) + T(n-1,k).at n=41A033877
- Composite numbers whose prime factors contain no digits other than 2 and 9.at n=32A036313
- Numbers whose base-3 representation has exactly 9 runs.at n=11A043589
- Numbers n such that number of runs in the base 3 representation of n is congruent to 1 mod 8.at n=27A043799
- Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 9.at n=11A043806
- Numbers k such that number of runs in the base 3 representation of k is congruent to 9 mod 10.at n=11A043824
- a(n) = Sum_{k=1..n, m=1..k} T(m,k); array T as in A049828.at n=43A049830
- Formal inverse of triangle A080246. Unsigned version of A080245.at n=39A080247
- Triangle read by rows: Aitken's array (A011971) but with a leading diagonal before it given by the Bell numbers (A000110), 1, 1, 2, 5, 15, 52, ...at n=49A095149
- Triangle read by rows: T(n,k) is the number of permutations of [n] with k runs of length 1. For example, 457/3/26/1 has two runs of length 1: 3 and 1.at n=39A097898
- Numbers n such that 4*10^n + 8*R_n - 5 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=14A102998
- Difference array of Bell numbers A000110 read by antidiagonals.at n=49A106436