Properties of the Number 69431

Sixty-Nine Thousand Four Hundred Thirty-One

Basics

Value: 69430 → 69431 → 69432

Parity: odd

Prime: Yes

Previous Prime: 69427

Next Prime: 69439

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 69431

Divisors: 1, 69431

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000111100110111

Octal: 207467

Duodecimal: 3421B

Hexadecimal: 10f37

Square: 4820663761

Square Root: 263.49762807281587

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

Primes of the form p² + p - 1 when p is prime. A53185

T(n,k)=Number of nXk binary arrays with each sum of a(1..i,1..j) no greater than i·j/2 and rows and columns in nondecreasing order. A183413

Number of partitions p of n such that 3·min(p) is a part of p. A238590

Second prime factor, if it exists, of Mersenne numbers. A89158

Triangle read by rows formed by the prime factors of Mersenne number 2^prime(n) - 1, n >= 1. A89162

Number of nX4 binary arrays with each sum of a(1..i,1..j) no greater than i·j/2 and rows and columns in nondecreasing order. A183411

Prime factors of 2^A054723(n)-1, ordered by increasing n, then by increasing size of the factors. A244453

Primes of the form n² + φ(n). A264771

Number of ways to write 2·n as p + 2^k + 5^m with p prime and 2^k + 5^m a product of at most three distinct primes, where k and m are nonnegative integers. A304031

Half the number of 5 X n binary arrays with no path of adjacent 1's or adjacent 0's from top row to bottom row. A69431