308
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 672
- Proper Divisor Sum (Aliquot Sum)
- 364
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 120
- Möbius Function
- 0
- Radical
- 154
- Omega Function (Ω)
- 4
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 24
- Smith 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
Names
- German
- dreihundertacht· ordinal: dreihundertachtste
- English
- three hundred eight· ordinal: three hundred eighth
- Spanish
- trescientos ocho· ordinal: 308º
- French
- trois cent huit· ordinal: trois cent huitième
- Italian
- trecentootto· ordinal: 308º
- Latin
- trecenti octo· ordinal: 308.
- Portuguese
- trezentos e oito· ordinal: 308º
Appears in sequences
- Number of n-node rooted trees of height 6.at n=10A000393
- Expansion of Product (1 - x^k)^8 in powers of x.at n=10A000731
- Number of n-step self-avoiding walks on f.c.c. lattice ending at point with x = 0.at n=3A000765
- Number of n-input 2-output switching networks under action of S(n) and complementing group C(2,2) on inputs and outputs.at n=2A000859
- Numbers that are the sum of 2 successive primes.at n=35A001043
- Partial sums of A001462; also a(n) is the last occurrence of n in A001462.at n=40A001463
- Numbers k such that phi(k) = phi(k+2).at n=10A001494
- Number of connected linear spaces with n (unlabeled) points.at n=9A001548
- a(n) = a(n-2) + a(n-3) + a(n-4), with initial values a(0) = 0, a(1) = 2, a(2) = 3, a(3) = 6.at n=14A001634
- The coding-theoretic function A(n,4,3).at n=43A001839
- Sum of totient function: a(n) = Sum_{k=1..n} phi(k), cf. A000010.at n=31A002088
- Numbers k such that 45*2^k - 1 is prime.at n=26A002242
- Numbers k such that 7*4^k + 1 is prime.at n=17A002255
- Numbers y such that p^2 = x^2 + y^2, 0 < x < y, p = A002144(n).at n=30A002365
- Let p = A007645(n) be the n-th generalized cuban prime and write p^2 = x^2 + 3*y^2 with y > 0; a(n) = y.at n=54A002368
- Heptagonal (or 7-gonal) pyramidal numbers: a(n) = n*(n+1)*(5*n-2)/6.at n=7A002413
- Expansion of (1-4*x)^(7/2).at n=10A002423
- Expansion of 1/((1-x)^4*(1+x)).at n=13A002623
- Numbers k such that (k^2 + k + 1)/13 is prime.at n=16A002642
- Number of integer points in a certain quadrilateral scaled by a factor of n.at n=25A002789