2390
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 4320
- Proper Divisor Sum (Aliquot Sum)
- 1930
- 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
- 952
- Möbius Function
- -1
- Radical
- 2390
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 120
- Smith Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that Fibonacci(k) == 55 (mod k).at n=35A023181
- Index of 10^n within the sequence of the numbers of the form 3^i*10^j.at n=47A025741
- a(n) = Sum{T(i,j)}, 0<=i<=n, 0<=j<=n, T given by A026681.at n=9A026690
- Number of partitions of n with equal nonzero number of parts congruent to each of 2, 3 and 4 (mod 5).at n=45A035591
- Numbers n such that BCR(n) = n, where BCR = binary-complement-and-reverse = take one's complement then reverse bit order.at n=36A035928
- Numbers whose base-4 and base-5 expansions have no digits in common.at n=44A037352
- a(1) = 1, a(m+1) = 2*Sum_{k=1..floor((m+1)/2)} a(k).at n=39A039722
- a(1) = 1, a(m+1) = 2*Sum_{k=1..floor((m+1)/2)} a(k).at n=40A039722
- Base-4 palindromes that start with 2.at n=31A043004
- Numbers whose base-2 representation has exactly 10 runs.at n=16A043577
- a(n) = (s(n)-1)/2, where s(n) is the n-th number whose base-2 representation has exactly 11 runs.at n=18A043691
- Numbers n such that number of runs in the base 2 representation of n is congruent to 1 mod 9.at n=27A043755
- Numbers n such that number of runs in the base 2 representation of n is congruent to 0 mod 10.at n=16A043763
- Numbers k such that the string 4,5 occurs in the base 9 representation of k but not of k-1.at n=32A044292
- Numbers n such that string 3,9 occurs in the base 10 representation of n but not of n-1.at n=26A044371
- Numbers n such that string 9,0 occurs in the base 10 representation of n but not of n-1.at n=25A044422
- Numbers n such that string 4,5 occurs in the base 9 representation of n but not of n+1.at n=32A044673
- Numbers k such that string 9,0 occurs in the base 10 representation of k but not of k+1.at n=25A044803
- Numbers whose base-4 representation contains exactly four 1's and two 2's.at n=10A045107
- Coordination sequence T3 for Zeolite Code DON.at n=33A047955