907
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
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 908
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 906
- Möbius Function
- -1
- Radical
- 907
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 54
- Smith Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 155
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- neunhundertsieben· ordinal: neunhundertsiebenste
- English
- nine hundred seven· ordinal: nine hundred seventh
- Spanish
- novecientos siete· ordinal: 907º
- French
- neuf cent sept· ordinal: neuf cent septième
- Italian
- novecentosette· ordinal: 907º
- Latin
- nongenti septem· ordinal: 907.
- Portuguese
- novecentos e sete· ordinal: 907º
Appears in sequences
- Primes that divide at least one term in every Fibonacci sequence.at n=35A000057
- Number of positive integers <= 2^n of form 2*x^2 + 3*y^2.at n=12A000075
- Number of positive integers <= 2^n of form x^2 + 6 y^2.at n=12A000077
- Record gaps between primes (upper end) (compare A002386, which gives lower ends of these gaps).at n=7A000101
- Number of bipartite partitions of n white objects and 3 black ones.at n=10A000412
- Primes p of the form 3k+1 such that -sqrt(p) < sum_{x=1..p} cos(2*Pi*x^3/p) < sqrt(p).at n=21A000922
- Numbers beginning with letter 'n' in English.at n=19A000981
- Smallest prime p such that there is a gap of 2n between p and previous prime.at n=9A001632
- Numbers k such that phi(2k+1) < phi(2k).at n=11A001837
- Largest prime p==3 (mod 8) such that Q(sqrt(-p)) has class number 2n+1.at n=1A002149
- Numbers k such that (k^2 + k + 1)/21 is prime.at n=43A002644
- Number of bipartite partitions of n white objects and 10 black ones.at n=3A002759
- a(n) = a(n-1) + a(n-4) with a(0) = 0, a(1) = a(2) = a(3) = 1.at n=24A003269
- Number of trees by stability index.at n=15A003428
- Divisible only by primes congruent to 4 mod 7.at n=27A004622
- Class 4+ primes (for definition see A005105).at n=12A005108
- Class 3- primes (for definition see A005109).at n=47A005111
- Let i, i+d, i+2d, ..., i+(n-1)d be an n-term arithmetic progression of primes; choose the one which minimizes the last term; then a(n) = last term i+(n-1)d.at n=6A005115
- Numbers k such that (11^k - 1)/10 is prime.at n=4A005808
- a(n) = 3 + n/2 + 7*n^2/2.at n=16A006124