902
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
- 1512
- Proper Divisor Sum (Aliquot Sum)
- 610
- 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
- 400
- Möbius Function
- -1
- Radical
- 902
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 54
- 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
- neunhundertzwei· ordinal: neunhundertzweiste
- English
- nine hundred two· ordinal: nine hundred second
- Spanish
- novecientos dos· ordinal: 902º
- French
- neuf cent deux· ordinal: neuf cent deuxième
- Italian
- novecentodue· ordinal: 902º
- Latin
- nongenti duo· ordinal: 902.
- Portuguese
- novecentos e dois· ordinal: 902º
Appears in sequences
- a(n) = n*(n+3)/2.at n=41A000096
- Numbers beginning with letter 'n' in English.at n=14A000981
- a(n) = solution to the postage stamp problem with 3 denominations and n stamps.at n=21A001208
- Number of partitions of 4n-1 into n nonnegative integers each no greater than 8.at n=9A001982
- Numbers k such that 45*2^k - 1 is prime.at n=33A002242
- Numbers k such that 7*4^k + 1 is prime.at n=19A002255
- Numbers k such that k, k+1 and k+2 have the same number of divisors.at n=18A005238
- Coefficients of modular function G_2(tau).at n=50A005760
- Number of points on surface of octahedron; also coordination sequence for cubic lattice: a(0) = 1; for n > 0, a(n) = 4n^2 + 2.at n=15A005899
- Cald's sequence: a(n+1) = a(n) - prime(n) if that value is positive and new, otherwise a(n) + prime(n) if new, otherwise 0; start with a(1)=1.at n=86A006509
- Number of meanders in which first bridge is 7.at n=6A006662
- Self-convolution of numbers of trees on n nodes.at n=11A006706
- Number of chord diagrams with n chords; number of pairings on a necklace.at n=6A007769
- Coordination sequence T5 for Zeolite Code MFI.at n=19A008168
- Multiples of 22.at n=41A008604
- Molien series for A_4.at n=38A008627
- Expansion of (1+x^11)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=40A008772
- a(n) = ceiling(n^2/3).at n=52A008810
- If a, b in sequence, so is a*b+2.at n=34A009299
- Expansion of e.g.f.: tan(tanh(x)*exp(x)).at n=6A009721