Properties of the Number 93493

Ninety-Three Thousand Four Hundred Ninety-Three

Basics

Value: 93492 → 93493 → 93494

Parity: odd

Prime: Yes

Previous Prime: 93491

Next Prime: 93497

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 93493

Divisors: 1, 93493

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10110110100110101

Octal: 266465

Duodecimal: 46131

Hexadecimal: 16d35

Square: 8740941049

Square Root: 305.766250590218

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, k) is the k-th number b > 1 such that b^prime(n+i-1) == 1 (mod prime(n+i)²) for each i = 0..4, with k running over the positive integers; square array, read by antidiagonals, downwards. A319062

Numbers b > 1 such that the smallest five primes, i.e., 2, 3, 5, 7 and 11 are base-b Wieferich primes. A339534

Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k 1-cell columns (0<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column. A121554

Primes p such that positive values of p - A002110(k) are all primes for k > 0. A68374

Smallest prime beginning and ending in 2n+1 or 0 if no such prime exists. A71234

a(n) = (n⁴ - n³ + 4·n² + 2)/2. A239592

Primes which yield again a prime when the digits are taken according to the lexicographically first superpermutation of corresponding order and of minimal length. A332088

Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 11011-01110-00100 pattern in any orientation. A147487

Define the total divisor symmetry of a number n to be the number of values r takes such that n-r and n+r have the same number of divisors. Sequence contains the total divisor symmetry of n. A93493