Properties of the Number 15052

Fifteen Thousand Fifty-Two

Basics

Value: 15051 → 15052 → 15053

Parity: even

Prime: No

Previous Prime: 15031

Next Prime: 15053

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 53 × 71

Divisors: 1, 2, 4, 53, 71, 106, 142, 212, 284, 3763

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 11101011001100

Octal: 35314

Duodecimal: 8864

Hexadecimal: 3acc

Square: 226562704

Square Root: 122.68659258452001

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

Integers that are Rhonda numbers to base 12. A100971

a(n) is the smallest number k larger than a(n-1) such that n·d(k)*sopf(k)=σ(k), where d is the number of divisors (A000005) and sopf the sum of prime factors without repetition (A008472). A134382

T(n,k)=Number of nXk 0..2 arrays with no element equal the average of immediate neighbors vertically above and horizontally left of it. A208445

a(n) = n plus sum of previous three terms. A62544

Number of partitions p of n such that 2*(number of even numbers in p) > (number of odd numbers in p). A241655

a(1)=1, a(n) = 24·a(n-1) + n. A14913

Number of permutations of length n which avoid the patterns 123, 3142, 4312; or avoid the patterns 123, 3421, 4231. A116721

Number of multisets of exactly seven partitions of positive integers into distinct parts with total sum of parts equal to n. A320792

Decimal part of n^1/11 starts with a 'nine digits' anagram. A34286

Numbers k such that the string k modulo 1000 is found at position k in the decimal digits of π. A153226