Properties of the Number 40465

Forty Thousand Four Hundred Sixty-Five

Basics

Value: 40464 → 40465 → 40466

Parity: odd

Prime: No

Previous Prime: 40459

Next Prime: 40471

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 8093

Divisors: 1, 5, 8093, 40465

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001111000010001

Octal: 117021

Duodecimal: 1B501

Hexadecimal: 9e11

Square: 1637416225

Square Root: 201.1591409804685

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

Let a(n) be the least k such that in the prime power factorization of k! the exponents of primes p₁, ...,p_n are even, while the exponent of p_n+1 is odd. A240537

Number of partitions of n such that the largest part is a multiple of the smallest part. A117086

Irregular table read by rows, in which row n lists the factorions in base n, for n >= 2. A193163

A Fibonacci convolution. A99484

a(n) = ceiling(Fibonacci(n)/3). A293543

Upper (1/3)-midsequence of (F(2n)) and (F(2n+1)), where F=A000045 (Fibonacci numbers); see Comments. A387783

a(n) is equal to the sum of the factorials of the digits of a(n-1), with a(1) = 0; each time a duplicated term appears, we replace it with the smallest integer not yet in the sequence and iterate. A351328

Numbers k such that both the k-th and (k+1)-th primes have the same sum of digits squared but different sets of digits. A109183

a(n) is the number of noncomposites (primes or 1) that are n digits long in balanced ternary notation. A233919

G.f. satisfies A(x) = (1 + x·A(x)) * (1 + 2·x*A(x)²). A216314