Properties of the Number 63041

Sixty-Three Thousand Forty-One

Basics

Value: 63040 → 63041 → 63042

Parity: odd

Prime: No

Previous Prime: 63031

Next Prime: 63059

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 11 ² × 521

Divisors: 1, 11, 121, 521, 5731, 63041

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111011001000001

Octal: 173101

Duodecimal: 30595

Hexadecimal: f641

Square: 3974167681

Square Root: 251.0796686312932

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Subsequence of A107629. Consider a Gaussian prime a+bi with index k in A103431. k is in A107632 when an integer multiplier m exists such that the distance of m·norm(a+bi) to k is minimal up to k. abs(m·norm(a+bi) - k) is minimal up to k. A107633 gives the squares of the norms of these Gaussian primes, A107634 the integer multipliers m. A107632

Sum of all matrix elements of n X n matrix M[i,j] = Lucas[i+j-1], (i,j = 1..n), where Lucas[n] = A000032[n] = Fibonacci[n-1] + Fibonacci[n+1]. A120537

Number of (n+1) X 5 binary arrays with every 2 X 2 subblock commuting with each of its horizontal and vertical 2 X 2 subblock neighbors. A186457

Image of n under Collatz-2 map, a generalization of the classical '3x+1' - function: instead of dividing an even number by 2 a nonprime will be divided by its smallest prime factor and a prime will be multiplied not by 3 but by its prime-predecessor, before one is added. A63041

a(n) = (9·n + 8)⁴. A17260

a(n) = (9n+1)⁴. A17176