470
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
- 8
- Divisor Sum
- 864
- Proper Divisor Sum (Aliquot Sum)
- 394
- 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
- 184
- Möbius Function
- -1
- Radical
- 470
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 128
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Names
- German
- vierhundertsiebzig· ordinal: vierhundertsiebzigste
- English
- four hundred seventy· ordinal: four hundred seventieth
- Spanish
- cuatrocientos setenta· ordinal: 470º
- French
- quatre cent soixante-dix· ordinal: quatre cent soixante-dixième
- Italian
- quattrocentosettanta· ordinal: 470º
- Latin
- quadringenti septuaginta· ordinal: 470.
- Portuguese
- quatrocentos e setenta· ordinal: 470º
Appears in sequences
- Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.at n=14A000125
- Number of n-stacks with strictly receding walls, or the number of Type A partitions of n in the sense of Auluck (1951).at n=22A001522
- A self-generating sequence: every positive integer occurs as a(i)-a(j) for a unique pair i,j.at n=12A001856
- Numbers m such that 3*2^m - 1 is prime.at n=24A002235
- a(n) = Sum_{d|n, d <= 4} d^2 + 4*Sum_{d|n, d>4} d.at n=53A002791
- Number of key permutations of length n: permutations {a_i} with |a_i - a_{i-1}| = 1 or 2.at n=12A003274
- Numbers that are the sum of 11 positive 5th powers.at n=19A003356
- Number of solid partitions of n supported on graph of cube.at n=12A003404
- a(n) = floor(100*log_2(n)).at n=25A004262
- a(n) = round(100*log_2(n)).at n=25A004263
- a(n) = round(n*phi^8), where phi is the golden ratio, A001622.at n=10A004943
- a(n) = ceiling(n*phi^8), where phi is the golden ratio, A001622.at n=10A004963
- Noncototients: numbers k such that x - phi(x) = k has no solution.at n=44A005278
- Starts 0, 4 and contains no 3-term arithmetic progression.at n=56A005487
- 1 + (sum of first n odd primes - n)/2.at n=23A005521
- If k appears so do 2k+2 and 3k+3. (duplicates omitted.)at n=50A005660
- Deficit in peeling rinds.at n=6A005675
- a(n) = cost of minimal multiplication-cost addition chain for n.at n=36A005766
- Numbers k such that k^16 + 1 is prime.at n=22A006313
- Worst cases for Pierce expansions (numerators).at n=15A006537