Properties of the Number 30071

Thirty Thousand Seventy-One

Basics

Value: 30070 → 30071 → 30072

Parity: odd

Prime: Yes

Previous Prime: 30059

Next Prime: 30089

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 30071

Divisors: 1, 30071

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111010101110111

Octal: 72567

Duodecimal: 1549B

Hexadecimal: 7577

Square: 904265041

Square Root: 173.40991897812535

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 such that the digital sum base 2 and the digital sum base 3 and the digital sum base 10 all are equal. A135120

Octal representation of the concatenation of the first n decimal numbers with the most significant digits first. A97583

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 4,4,0,0,1 for x=0,1,2,3,4. A197098

Least odd number k such that x' = k has n solutions, where x' is the arithmetic derivative (A003415) of x. A189560

Intersection of A392605 and A392611. A392606

Least prime k such that x' = k has n solutions, where x' is the arithmetic derivative (A003415) of x. A189559

O.g.f.: ∑_n>=0 nⁿ * (1+n·x)^4·n * xⁿ/n! * exp(-n·x*(1+n·x)⁴). A218679

Number of partitions of 6n into exactly 4 parts. A256328

a(n) is the first prime that is (product + sum) of 2·n consecutive primes. A387590

P(n,k) is an array read by rows, with n > 0 and k=1..5, where row n gives the chain of 5 consecutive primes {p(i), p(i+1), p(i+2), p(i+3), p(i+4)} having the symmetrical property p(i) + p(i+4) = p(i+1) + p(i+3) = 2·p(i+2) for some index i. A267028