2063
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 2064
- 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
- 2062
- Möbius Function
- -1
- Radical
- 2063
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 37
- Smith Number
- no
- Vampire 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
- yes
- Safe Prime
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 311
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p == 7, 19, 23 (mod 40) such that (p-1)/2 is also prime.at n=17A000353
- Primes p == 3, 9, 11 (mod 20) such that 2p+1 is also prime.at n=31A000355
- Primes with 5 as smallest primitive root.at n=44A001124
- Numbers k such that phi(2k-1) < phi(2k), where phi is Euler's totient function A000010.at n=29A001836
- Numbers k such that 45*2^k - 1 is prime.at n=40A002242
- Lucasian primes: p == 3 (mod 4) with 2*p+1 prime.at n=33A002515
- Convolution of A002024 with itself.at n=50A004797
- Safe primes p: (p-1)/2 is also prime.at n=39A005385
- Optimal cost of search tree for searching an ordered array of n elements with cost k of probing element k.at n=30A007077
- Where the prime race among 5k+1, ..., 5k+4 changes leader.at n=19A007353
- Coordination sequence T2 for Zeolite Code ATV.at n=29A008044
- Coordination sequence T10 for Zeolite Code EUO.at n=28A008096
- Coordination sequence T1 for Zeolite Code LTL.at n=33A008138
- Coordination sequence T1 for Zeolite Code NES.at n=29A008205
- Molien series for alternating group Alt_12 (or A_12).at n=26A008635
- Number of partitions of n into at most 12 parts.at n=26A008641
- Coordination sequence for alpha-Mn, Position Mn1.at n=12A009950
- a(n) = floor(n*(n - 1)*(n - 2)/31).at n=41A011913
- Numbers k such that the continued fraction for sqrt(k) has period 24.at n=33A020363
- Fibonacci sequence beginning 3, 7.at n=13A022120