407
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
- 4
- Divisor Sum
- 456
- Proper Divisor Sum (Aliquot Sum)
- 49
- 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
- 360
- Möbius Function
- 1
- Radical
- 407
- 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
- yes
- Narcissistic Number
- yes
- Collatz Steps
- 40
- 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
- vierhundertsieben· ordinal: vierhundertsiebenste
- English
- four hundred seven· ordinal: four hundred seventh
- Spanish
- cuatrocientos siete· ordinal: 407º
- French
- quatre cent sept· ordinal: quatre cent septième
- Italian
- quattrocentosette· ordinal: 407º
- Latin
- quadringenti septem· ordinal: 407.
- Portuguese
- quatrocentos e sete· ordinal: 407º
Appears in sequences
- a(n) = floor(n^(3/2)).at n=55A000093
- Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts.at n=28A000124
- Number of partitions of n, with two kinds of 1, 2, 3 and 4.at n=10A000710
- Boustrophedon transform of triangular numbers.at n=5A000746
- Numbers beginning with letter 'f' in English.at n=31A000867
- Numbers k such that sum of squares of k consecutive integers >= 1 is a square.at n=46A001032
- Moran numbers: k such that k/(sum of digits of k) is prime.at n=32A001101
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 25, 50 cents.at n=50A001302
- Number of transitive permutation groups of degree n.at n=34A002106
- Numbers k such that 39*2^k + 1 is prime.at n=22A002269
- 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) = x.at n=41A002367
- 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) = x.at n=51A002367
- Numbers that are the sum of 2 positive cubes.at n=23A003325
- Numbers that are the sum of 7 positive 4th powers.at n=35A003341
- Numbers that are the sum of 12 positive 4th powers.at n=52A003346
- Numbers that are the sum of 10 positive 5th powers.at n=16A003355
- Primes written in base 8.at n=55A004682
- a(n) = 8*n + 7. Or, numbers whose binary expansion ends in 111.at n=50A004771
- a(n) = ceiling(n*phi^7), where phi is the golden ratio, A001622.at n=14A004962
- Sums of two nonnegative cubes.at n=31A004999