24
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 60
- Proper Divisor Sum (Aliquot Sum)
- 36
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8
- Möbius Function
- 0
- Radical
- 6
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
Special
- Factorial
- yes
- 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
- yes
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 10
- Smith Number
- no
Classification
- Natural
- yes
- Even
- yes
- Odd
- 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
- yes
- Carmichael Number
- no
Names
- German
- vierundzwanzig· ordinal: vierundzwanzigste
- English
- twenty-four· ordinal: twenty-fourth
- Spanish
- veinticuatro· ordinal: 24º
- French
- vingt-quatre· ordinal: vingt-quatrième
- Italian
- ventiquattro· ordinal: 24º
- Latin
- viginti quattuor· ordinal: 24.
- Portuguese
- vinte e quatro· ordinal: 24º
Appears in sequences
- Euler totient function phi(n): count numbers <= n and prime to n.at n=34A000010
- Euler totient function phi(n): count numbers <= n and prime to n.at n=38A000010
- Euler totient function phi(n): count numbers <= n and prime to n.at n=44A000010
- Euler totient function phi(n): count numbers <= n and prime to n.at n=51A000010
- Euler totient function phi(n): count numbers <= n and prime to n.at n=55A000010
- Mosaic numbers or multiplicative projection of n: if n = Product (p_j^k_j) then a(n) = Product (p_j * k_j).at n=35A000026
- Mosaic numbers or multiplicative projection of n: if n = Product (p_j^k_j) then a(n) = Product (p_j * k_j).at n=47A000026
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=23A000027
- Let k = p_1^e_1 p_2^e_2 p_3^e_3 ... be the prime factorization of n. Sequence gives k such that the sum of the numbers of 1's in the binary expansions of e_1, e_2, e_3, ... is odd.at n=12A000028
- Numbers that are not squares (or, the nonsquares).at n=19A000037
- Order of the group SL(2,Z_n).at n=2A000056
- Numbers k such that (2k)^4 + 1 is prime.at n=9A000059
- Generalized tangent numbers d(n,1).at n=14A000061
- Generalized tangent numbers d(n,1).at n=16A000061
- Partial sums of (unordered) ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=7A000064
- Smallest number of vertices in trivalent graph with girth (shortest cycle) = n.at n=4A000066
- Numbers k such that k^4 + 1 is prime.at n=6A000068
- Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) for n >= 3 with a(0) = a(1) = 0 and a(2) = 1.at n=8A000073
- Number of integers <= 2^n of form 4 x^2 + 4 x y + 5 y^2.at n=7A000076
- Number of positive integers <= 2^n of form x^2 + 6 y^2.at n=6A000077