9015
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14448
- Proper Divisor Sum (Aliquot Sum)
- 5433
- 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
- 4800
- Möbius Function
- -1
- Radical
- 9015
- 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
- 91
- Smith Number
- yes
- Vampire 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
- no
- Odd
- yes
Appears in sequences
- a(n) = floor(n*phi^12), where phi is the golden ratio, A001622.at n=28A004927
- Numbers in which 0,1,2,3,4,5 all occur in base 6.at n=22A031947
- Digit sum of 'odd' number equals digit sum of 'sum' and 'juxtaposition' of its prime factors (counted with multiplicity).at n=41A036927
- Digitally balanced numbers in base 6: equal numbers of 0's, 1's, ..., 5's.at n=22A049357
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n-1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 4.at n=14A049929
- Squarefree n such that the elliptic curve n*y^2 = x^3 - x arising in the "congruent number" problem has rank 3.at n=12A062693
- Numbers n such that 5*10^n + 7*R_n - 4 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=11A103020
- n+p(n)+p(p(n)) is a palindrome, where p(n) denotes the n-th prime.at n=19A116037
- Multiples of 15 containing a 15 in their decimal representation.at n=42A121035
- a(n) = 392*n - 1.at n=22A158004
- a(n) = 361*n^2 - 2*n.at n=4A158307
- a(n) = 46*n^2 - 1.at n=13A158634
- Smallest sequence which lists the position of digits "8" in the sequence.at n=47A167450
- Number of (n+2) X 4 binary arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=17A190026
- Number of partitions p of n such that the number of distinct parts is not a part and max(p) - min(p) is not a part.at n=36A241390
- Numbers n such that A = n - digitsum(n) is divisible by the largest power of 10 <= A.at n=34A242474
- Ulam numbers n such that 3*n is also an Ulam number.at n=39A285885
- Number of partitions of n into parts that contain primes to odd powers only (A002035).at n=52A290369
- Partitions with designated summands in which no parts are multiples of 3.at n=26A293569
- Number of n X n 0..1 arrays with every element equal to 0, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=5A300676