763
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 880
- Proper Divisor Sum (Aliquot Sum)
- 117
- 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
- 648
- Möbius Function
- 1
- Radical
- 763
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 152
- Smith 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
Names
- German
- siebenhundertdreiundsechzig· ordinal: siebenhundertdreiundsechzigste
- English
- seven hundred sixty-three· ordinal: seven hundred sixty-third
- Spanish
- setecientos sesenta y tres· ordinal: 763º
- French
- sept cent soixante-trois· ordinal: sept cent soixante-troisième
- Italian
- settecentosessantatre· ordinal: 763º
- Latin
- septingenti sexaginta tres· ordinal: 763.
- Portuguese
- setecentos e sessenta e três· ordinal: 763º
Appears in sequences
- Let A(n) = #{(i,j,k): i^2 + j^2 + k^2 <= n}, V(n) = (4/3)Pi*n^(3/2), P(n) = A(n) - V(n); A000092 gives values of n where |P(n)| sets a new record; sequence gives (nearest integer to, I believe) P(A000092(n)).at n=29A000223
- Flavius Josephus's sieve: Start with the natural numbers; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=30A000960
- Number of degree-n permutations of order exactly 2.at n=7A001189
- Numbers that are the sum of 4 cubes in more than 1 way.at n=46A001245
- Related to Gilbreath conjecture.at n=15A001549
- Numbers k such that 3^k, 3^(k+1) and 3^(k+2) have the same number of digits.at n=35A001682
- A generalized partition function.at n=10A002601
- Numbers that are the sum of 6 positive 5th powers.at n=19A003351
- Divisors of 2^36 - 1.at n=52A003543
- Add 4, then reverse digits; start with 0.at n=31A003608
- Number of numbers of complexity n, i.e., that can be built from n ones using + and *, and require at least that many ones.at n=23A005421
- Numbers k such that 10*3^k + 1 is prime.at n=15A005539
- Number of n-node connected graphs with at most one cycle.at n=10A005703
- Related to representations as sums of Fibonacci numbers.at n=44A006132
- Number of partitions of n into nonzero triangular numbers.at n=58A007294
- Add 8, then reverse digits!.at n=29A007399
- Number of Young tableaux of height <= 7.at n=8A007578
- Coordination sequence T5 for Zeolite Code AET.at n=19A008011
- Coordination sequence T2 for Zeolite Code AFS.at n=21A008024
- Coordination sequence T1 for Zeolite Code ATS.at n=20A008038