Properties of the Number 45362

Forty-Five Thousand Three Hundred Sixty-Two

Basics

Value: 45361 → 45362 → 45363

Parity: even

Prime: No

Previous Prime: 45361

Next Prime: 45377

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 37 × 613

Divisors: 1, 2, 37, 74, 613, 1226, 22681, 45362

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011000100110010

Octal: 130462

Duodecimal: 22302

Hexadecimal: b132

Square: 2057711044

Square Root: 212.98356744124652

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

List of amicable sums-of-factorial-of-digits pairs (A,B): A equals the sum of the factorials of B's digits in base 10, and vice versa. A214285

Amicable factorions. A254499

a(n) is the smallest k such that A342068(k) = n. A342069

Number of partitions of n with at most five part sizes. A364809

Finite sequence of numbers n such that iterations for the map r -> A061602(r) starting with n ends with the same number n. A188284

a(0)=1. a(n) = a(n-1)*(n+1), if n is in the sequence. a(n)= a(n-1) +1, if n is missing from the sequence. A118471

The number of iterations for the map r -> A061602(r), starting with n, needed to reach the end of the first cycle. A173447

Size of orbit of n under repeated application of sum of factorial of digits of n. A303935

Primes congruent to {1, 2, 4, 5} mod 7. A45362