307
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 308
- 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
- 306
- Möbius Function
- -1
- Radical
- 307
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 37
- 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
- 63
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- dreihundertsieben· ordinal: dreihundertsiebenste
- English
- three hundred seven· ordinal: three hundred seventh
- Spanish
- trescientos siete· ordinal: 307º
- French
- trois cent sept· ordinal: trois cent septième
- Italian
- trecentosette· ordinal: 307º
- Latin
- trecenti septem· ordinal: 307.
- Portuguese
- trezentos e sete· ordinal: 307º
Appears in sequences
- Number of nonisomorphic minimal triangle graphs.at n=8A000080
- Number of partitions into non-integral powers.at n=5A000263
- a(n) = number of solid (i.e., three-dimensional) partitions of n.at n=7A000293
- Primes p of the form 3k+1 such that Sum_{x=1..p} cos(2*Pi*x^3/p) > sqrt(p).at n=14A000921
- Irregular primes: primes p such that at least one of the numerators of the Bernoulli numbers B_2, B_4, ..., B_{p-3} (A000367) is divisible by p.at n=14A000928
- Flavius Josephus's sieve: Start with the natural numbers; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=19A000960
- a(n) = least m such that if a/b < c/d where a,b,c,d are integers in [0,n], then a/b < k/m < c/d for some integer k.at n=21A001000
- Number of sublattices of index n in generic 3-dimensional lattice.at n=16A001001
- Primes with 5 as smallest primitive root.at n=10A001124
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/3.at n=6A001133
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^5)).at n=22A001304
- Number of ways of making change for n cents using coins of 1, 2, 4, 10 cents.at n=44A001362
- Number of ways of making change for n cents using coins of 1, 2, 4, 10 cents.at n=45A001362
- a(n) = ceiling(Pi^n).at n=5A001673
- Cyclic numbers: 10 is a quadratic residue modulo p and class of mantissa is 2.at n=18A001914
- Primes p such that the congruence 2^x == 3 (mod p) is solvable.at n=35A001915
- Number of partitions of n into parts 2, 3, 4, 5, 6, 7.at n=32A001996
- Prime determinants of forms with class number 2.at n=30A002052
- Central polygonal numbers: a(n) = n^2 - n + 1.at n=18A002061
- Primes of the form 4*k + 3.at n=32A002145