Properties of the Number 90123

Ninety Thousand One Hundred Twenty-Three

Basics

Value: 90122 → 90123 → 90124

Parity: odd

Prime: No

Previous Prime: 90121

Next Prime: 90127

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 11 × 2731

Divisors: 1, 3, 11, 33, 2731, 8193, 30041, 90123

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10110000000001011

Octal: 260013

Duodecimal: 441A3

Hexadecimal: 1600b

Square: 8122155129

Square Root: 300.2049300061543

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 in which each digit is the (immediate) successor of the previous one (if it exists) and 0 is considered the successor of 9. A59043

Composites with consecutive (ascending) digits. A161760

Smallest number that has digits in order ...123...901... and is divisible by n. If no such number exists then a(n) = 0. A61805

Smallest available integer which fits into the repeating pattern 0123456789. A98755

Let S = 12345678901234567890123456..., the cyclic concatenation of digits; partition this string into distinct squarefree numbers. To avoid leading zeros, no member may end with the digit 9. A85944

Octagonal numbers: n*(3·n-2). Also called star numbers. A567

Dirichlet inverse of Euler totient function (A000010). A23900

Let S denote the palindromes in the language {0,1}*; a(n) = number of words of length n in the language SS. A7055

Array read by antidiagonals: T(n,k) = number of double palindromes of length n using a maximum of k different symbols. A284873

a(n) = (n/4)*2^n/2*((1+sqrt(2))² + (-1)ⁿ*(1-sqrt(2))²). A187272