ℕ atory
Play Now

Properties of the Number 13103

Thirteen Thousand One Hundred Three

Basics

Value: 13102 → 13103 → 13104

Parity: odd

Prime: Yes

Previous Prime: 13099

Next Prime: 13109

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 13103

Divisors: 1, 13103

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 11001100101111

Octal: 31457

Duodecimal: 76BB

Hexadecimal: 332f

Square: 171688609

Square Root: 114.46833623321342

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

Numbers k such that (11k - 3k)/8 is prime. A128027
Primes having only {0, 1, 3} as digits. A260044
On a spirally numbered square grid, with labels starting at 1, this is the number of steps that a (1,n) leaper makes before getting trapped, or -1 if it never gets trapped. A323469
Iterates of A014580, starting with a(0) = 1, a(n) = A014580n(1). [Here A014580n means the n-th fold application of A014580]. A91230
Prime numbers n such that n = p13 + p23 + p33, a sum of cubes of 3 distinct prime numbers. A137365
Numbers which are the sum of 3 cubes of distinct odd primes. A138853
Primes which are the sum of three distinct positive cubes in two or more distinct ways. A180088
The largest number m such that σ(m) = A007368(n), where A007368(n) = the smallest k such that σ(x) = k has exactly n solutions. A184394
Primes p such that each decimal digit of p is equal to the difference of two other digits of p. A255892
Triangle read by rows: T(m,n) (1 <= n < m) is the number of moves of an (m,n)-leaper (a generalization of a chess knight) until it can no longer move, starting on a board with squares spirally numbered from 1. Each move is to the lowest-numbered unvisited square. T(m,n) = -1 if the path never terminates. A323749