Properties of the Number 11790

Eleven Thousand Seven Hundred Ninety

Basics

Value: 11789 → 11790 → 11791

Parity: even

Prime: No

Previous Prime: 11789

Next Prime: 11801

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 5 × 131

Divisors: 1, 2, 3, 5, 6, 9, 10, 15, 18, 30

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10111000001110

Octal: 27016

Duodecimal: 69A6

Hexadecimal: 2e0e

Square: 139004100

Square Root: 108.58176642512315

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

Coordination sequence for "tcd" 3D uniform tiling. A299287

a(n) = 10·a(n-1) + 10·a(n-2), with a(0)=1, a(1)=9, a(2)=99. A155157

Number of ways to write n as an ordered sum of 9 prime powers (including 1). A341138

Triangle read by rows: T(n,k) is the number of labeled commutative monoids of order n with k idempotents and a fixed identity. A58160

Numbers n = concat(a,b) such that φ(n) = φ(a) * φ(b), where φ = A000010. A147619

Number of partitions of n such that m(greatest part) <= m(1), where m = multiplicity. A240077

Minimal k > n such that (4·k+3·n) * (4·n+3·k) is a square. A83752

Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-6). A23436

Numbers n such that d(n + d(n)) = d(n), where d(n) is the sum of the distinct primes dividing n. A175760

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