915
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 1488
- Proper Divisor Sum (Aliquot Sum)
- 573
- 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
- 480
- Möbius Function
- -1
- Radical
- 915
- 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
- 129
- Smith Number
- yes
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
- no
- Odd
- yes
Names
- German
- neunhundertfünfzehn· ordinal: neunhundertfünfzehnste
- English
- nine hundred fifteen· ordinal: nine hundred fifteenth
- Spanish
- novecientos quince· ordinal: 915º
- French
- neuf cent quinze· ordinal: neuf cent quinzième
- Italian
- novecentoquindici· ordinal: 915º
- Latin
- nongenti quindecim· ordinal: 915.
- Portuguese
- novecentos e quinze· ordinal: 915º
Appears in sequences
- a(n) = Sum_{k=0..n} p(k) where p(k) = number of partitions of k (A000041).at n=16A000070
- Number of bicentered hydrocarbons with n atoms.at n=14A000200
- Coefficients of ménage hit polynomials.at n=7A000386
- Numbers beginning with letter 'n' in English.at n=27A000981
- Number of solutions to a linear inequality.at n=27A002797
- Smith (or joke) numbers: composite numbers k such that sum of digits of k = sum of digits of prime factors of k (counted with multiplicity).at n=45A006753
- Number of one-sided strictly 3-dimensional polyominoes with n cells.at n=6A006759
- Numbers k such that phi(k) = phi(sigma(k)).at n=37A006872
- a(n) = n*(4*n+1).at n=15A007742
- Number of non-Abelian metacyclic groups of order p^n (p odd).at n=36A007983
- Nearest integer to (n/2)^4.at n=11A011863
- Numbers k that divide s(k), where s(1)=1, s(j)=15*s(j-1)+j.at n=19A014865
- Numbers k that divide s(k), where s(1)=1, s(j)=25*s(j-1)+j.at n=43A014876
- Number of ordered triples of integers from [ 1..n ] with no global factor.at n=17A015631
- Numbers k such that k | 14^k + 1.at n=26A015965
- Divisors of 915.at n=7A018719
- Coordination sequence T1 for Zeolite Code CGF.at n=21A019451
- a(n)^2 is the least square base-n doublet (base-n representation is the concatenation of 2 identical strings).at n=12A020339
- a(n) = a(n-2) + c(n-1) for n >= 3, a( ) increasing, given a(1)=2, a(2)=3, where c( ) is complement of a( ).at n=52A022943
- a(n) = a(n-2) + c(n-1) for n >= 3, a( ) increasing, given a(1)=2, a(2)=4; where c( ) is complement of a( ).at n=52A022944