Properties of the Number 75013

Seventy-Five Thousand Thirteen

Basics

Value: 75012 → 75013 → 75014

Parity: odd

Prime: Yes

Previous Prime: 75011

Next Prime: 75017

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 75013

Divisors: 1, 75013

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10010010100000101

Octal: 222405

Duodecimal: 374B1

Hexadecimal: 12505

Square: 5626950169

Square Root: 273.8850123683295

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

a(n) = Fibonacci(2n + 1) - n. A280523

a(0) = a(1) = 1; for n>1, a(n) = a(n-1) + a(n-2) + floor(n/2). A215004

a(n) = a(n-1) + a(n-2) + a([(n-1)/2]), where a(0) = 1, a(1) = 1, a(2) = 1. A298352

Numbers that have decimal expansion c(1)c(2)...c(n) with distinct digits that satisfy c(1) <> 0, c(1) is the largest digit, and for each i in 1..n there is j in {0, 1} such that c(i) == 2·c(i-1) + j (mod 10) (with c(0): = c(n)). A336670

Consecutive states of the linear congruential pseudo-random number generator (2661·s + 36979) mod 175000 when started at s=1. A385361

Number of distinct coefficients in expansion related to enumeration of permutations of length n by length of longest subsequence. A68604

a(0)=0, a(n+1) is the least k>a(n) such that k+a(n)+n+1 is a Fibonacci number. A215006

Smallest k such that the decimal concatenation of k and k+1 is divisible by n. A75013