Properties of the Number 11461

Eleven Thousand Four Hundred Sixty-One

Basics

Value: 11460 → 11461 → 11462

Parity: odd

Prime: No

Previous Prime: 11447

Next Prime: 11467

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 73 × 157

Divisors: 1, 73, 157, 11461

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10110011000101

Octal: 26305

Duodecimal: 6771

Hexadecimal: 2cc5

Square: 131354521

Square Root: 107.05606008068857

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 distinct lines through the origin in 3-dimensional cube of side length n. A90025

Number of one-element transitions from the partitions of n to the partitions of n+1 for labeled parts. A93694

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 2 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = 1 and a(3) = 2. A50031

Number of equivalence classes of ballot paths of length n for the string uu. A274110

a(n) = 10000·log₁₀(n) rounded down. A4228

Positive numbers having the same set of digits in base 9 and base 10. A37443

Semiprimes p1·p2 such that p2 > p1 and p2 mod p1 = 11. A64909

a(n) = 6·binomial(n,4) + 5·binomial(n,2) - 4·n + 5. A66455

Odd winning positions in Fibonacci nim. A120904

Triangle read by rows: T(n,m) (n >= 1, 1 <= m <= n) = number of set partitions of [n], avoiding 123454, with m blocks. A250119