Properties of the Number 69003

Sixty-Nine Thousand Three

Basics

Value: 69002 → 69003 → 69004

Parity: odd

Prime: No

Previous Prime: 69001

Next Prime: 69011

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 11 × 17 × 41

Divisors: 1, 3, 9, 11, 17, 33, 41, 51, 99, 123

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000110110001011

Octal: 206613

Duodecimal: 33B23

Hexadecimal: 10d8b

Square: 4761414009

Square Root: 262.6842210716129

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) = ∑_d∣3 φ(d)*n^3/d. A54602

Nonnegative values·of solutions (x, y) to the Diophantine equation x²+(x+17)² = y². A118120

a(n) = 7·a(n-1) - 7·a(n-2) + a(n-3) for n > 2; a(0) = 0, a(1) = 51, a(2) = 340. A155464

The Wiener index of the ortho-polyphenyl chain with n hexagons (see the Dou et al. and the Deng references). A216108

a(n) = smallest k having at least four prime divisors d such that (d + n) | (k + n). A202159

Smallest integer d such that n² + d² is a prime number. A69003

Let c (resp. C) be the smallest (resp. largest) number that can be obtained by cyclically permuting the digits of n; a(n) = C - c. A347688

Number of (n+1) X 4 0..3 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to the number of counterclockwise edge increases. A208487