Properties of the Number 11475

Eleven Thousand Four Hundred Seventy-Five

Basics

Value: 11474 → 11475 → 11476

Parity: odd

Prime: No

Previous Prime: 11471

Next Prime: 11483

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 5 ² × 17

Divisors: 1, 3, 5, 9, 15, 17, 25, 27, 45, 51

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110011010011

Octal: 26323

Duodecimal: 6783

Hexadecimal: 2cd3

Square: 131675625

Square Root: 107.12142642814275

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

Base-2 expansion of a(n) encodes the steps where numbers of the form 4k+3 are encountered when map x -> A252463(x) is iterated down to 1, starting from x=n. A292383

Numbers m such that there are precisely 17 groups of order m. A294949

A(n,k) is the n-th Rhonda number to base A002808(k), the k-th composite number; square array A(n,k), n>=1, k>=1, read by antidiagonals. A291925

Integers that are Rhonda numbers to base 14. A100972

Numbers n such that the decimal expansions of both n and n² have 1 as smallest digit and 7 as largest digit. A257210

Smallest Rhonda number to base b = n-th composite number, A002808(n). A255872

Numbers n for which nontrivial positive magic squares of exactly 10 different orders with magic sum n exist. For a definition of nontrivial positive magic squares, see A125005. A125017

T(n,k)=Number of nXk 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and no element equal to any horizontal or vertical neighbor. A199133

Position of first appearance of n in the run-lengths (differing by 0) of the run-lengths (differing by 2) of the odd primes. A373825

a(n) = 8·n² + 14·n + 5. A181890