Properties of the Number 1599

One Thousand Five Hundred Ninety-Nine

Basics

Value: 1598 → 1599 → 1600

Parity: odd

Prime: No

Previous Prime: 1597

Next Prime: 1601

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 13 × 41

Divisors: 1, 3, 13, 39, 41, 123, 533, 1599

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11000111111

Octal: 3077

Duodecimal: B13

Hexadecimal: 63f

Square: 2556801

Square Root: 39.98749804626441

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

a(n) = n*(n+2) = (n+1)² - 1. A5563

Expansion of ∏_m>=1 (1 + q^m)^m; number of partitions of n into distinct parts, where n different parts of size n are available. A26007

Sub-perfect powers: perfect powers (squares, cubes etc., not including 1) minus 1. A45542

a(n) = 4·n² - 1. A466

Partial sums of A299287. A299288

Number of numbers whose base-3/2 expansion (see A024629) has n digits. A81848

a(n) = n² - 2·n. A67998

Fully additive with a(p) = Fibonacci(p); If, for p prime, p^m_n,p is the highest power of p dividing n with m>=0, then a(n) = ∑_{p prime} F(p)*(m_n,p), where F(p) = p-th Fibonacci number. A113177

a(n) = floor(a(n-1)*3/2) with a(1) = 2. A61418

Number of partitions of n such that 2*(greatest part) = (number of parts). A237753