16403
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16800
- Proper Divisor Sum (Aliquot Sum)
- 397
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16008
- Möbius Function
- 1
- Radical
- 16403
- Omega Function (Ω)
- 2
- 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
- 115
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- From George Gilbert's marks problem: jumping 3 marks at a time (initial positions).at n=20A019592
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 13 ones.at n=30A031781
- a(n) = (5*3^(n-1)+1)/2.at n=8A057198
- Composite and every divisor (except 1) contains the digit 4.at n=5A062670
- Sums of terms of groups in A075621.at n=31A075625
- a(0)=3, a(n) = 3*a(n-1) + 2*(-1)^n.at n=8A096019
- a(n) = the numerator of the continued fraction [[n/1];[n/2],[n/3],..,[n/n]] = the numerator of [[n/n];[n/(n-1)],[n/(n-2)],..,[n/1]], where [x] is floor(x).at n=10A128599
- a(n) = (5*9^n + 1)/2.at n=4A135423
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 0110-1111-0100 pattern in any orientation.at n=13A146592
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 1, 1), (0, 0, 1), (1, 0, 0), (1, 1, 0)}.at n=7A151102
- Numbers n such that phi(n)=2*phi(n-1).at n=19A171271
- Numbers n such that the digits of sigma(n) are exactly the same (albeit in different order) as the digits of phi(n), in base 10.at n=21A175795
- Dispersion of (3*n-1), read by antidiagonals.at n=46A191450
- a(n) = floor((5^n)/(3^n + 2^n)).at n=18A191696
- Surface area of a certain twisted cube.at n=5A199674
- Permutation of natural numbers: a(n) = A048673(A122111(n)).at n=45A243506
- a(1) = 1, then A007051 ((3^n)+1)/2 interleaved with A057198 (5*3^(n-1)+1)/2.at n=18A246360
- Square array A by downward antidiagonals: A(n,k) = (3 + 3^n*(2*floor(3*k/2) - 1))/6, n,k >= 1; read as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...at n=53A254051
- Square array A(row,col) = A000265(A254051(row,col)).at n=53A254101
- Smallest k such that A285481(k) >= n, i.e., lowest d where the smallest integer radius needed for a d-dimensional ball to have a volume >= 1 is at least n.at n=31A285482