Properties of the Number 27469

Twenty-Seven Thousand Four Hundred Sixty-Nine

Basics

Value: 27468 → 27469 → 27470

Parity: odd

Prime: No

Previous Prime: 27457

Next Prime: 27479

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 13 × 2113

Divisors: 1, 13, 2113, 27469

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110101101001101

Octal: 65515

Duodecimal: 13A91

Hexadecimal: 6b4d

Square: 754545961

Square Root: 165.73774464496614

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

Number of maximal product-free subsets of {1..n}. A326496

Number of maximal sum-free and product-free subsets of {1..n}. A326497

Odd composite numbers k all of whose divisors larger than 1 are not binary palindromes (A006995) such that the divisors of the binary reversal of k (A030101) are the binary reversals of the divisors of k. A331664

Odd composite numbers n, such that n, n+d, n·d and n/d are all odious (A000069) for every divisor d of n. A231558

a(n) = n + floor( n²/2 + n³/3 ). A236773

G.f. = b(2)²*b(4)/(2·x⁵+x⁴-2·x³-x²-x+1), where b(k) = (1-x^k)/(1-x). A266370

Number of third differences of arrays of length 5 of numbers in 0..n. A228261

Number of permutations of length n which avoid the patterns 1234, 2143, 3421. A116842

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (0, 0, -1), (1, 0, 0), (1, 0, 1)}. A150348

Numbers with all different digits such that each digit leaves the same nonzero remainder when each is divided into the number. A152852