Properties of the Number 49959

Forty-Nine Thousand Nine Hundred Fifty-Nine

Basics

Value: 49958 → 49959 → 49960

Parity: odd

Prime: No

Previous Prime: 49957

Next Prime: 49991

Digit Sum: 36

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 7 × 13 × 61

Divisors: 1, 3, 7, 9, 13, 21, 39, 61, 63, 91

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100001100100111

Octal: 141447

Duodecimal: 24AB3

Hexadecimal: c327

Square: 2495901681

Square Root: 223.51510016104058

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

Differences between two positive cubes in exactly 2 ways. A14440

Difference between two positive cubes in more than one way. A34179

Pairs of deficient numbers having the same value of σ(k)/k in the order that they are found. A211680

Sum of two (possibly negative) coprime cubes in at least 2 ways, but not the sum of 2 noncoprime cubes. A293648

a(n) = (a(n-1) + a(n-3))/gcd(a(n-1), a(n-3)) with a(0) =2, a(1) = 3, a(2) = 5. A214331

Numbers k such that the sum of the Carmichael λ functions of the divisors is a proper divisor of k. A131492

The larger companion to the deficient numbers in A212608. A212609

Numbers with five neighboring primes on the hexagonal spiral board of odd numbers. A345654

a(n) is the smallest number m such that the sum of the digits of n+m is n. A130692

a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2·n - 2 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 2, and a(3) = 3. A49959