Properties of the Number 3495

Three Thousand Four Hundred Ninety-Five

Basics

Value: 3494 → 3495 → 3496

Parity: odd

Prime: No

Previous Prime: 3491

Next Prime: 3499

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 233

Divisors: 1, 3, 5, 15, 233, 699, 1165, 3495

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 110110100111

Octal: 6647

Duodecimal: 2033

Hexadecimal: da7

Square: 12215025

Square Root: 59.11852501542981

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

Positive integers which apparently never result in a palindrome under repeated applications of the function A056964(x) = x + (x with digits reversed). A23108

Number of partitions of n such that some part is a sum of two other parts. A237113

Number of partitions of n for which the number of odd parts is equal to the positive alternating sum of the parts. A277103

Array read by antidiagonals: T(m,n) is the number of fixed polyominoes that have a width of m and height of n. A292357

Numbers k such that σ(k) = σ(k+7). A15867

a(n) = n*(31·n + 1)/2. A22289

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..2 nXk array. A219128

Number of ways to write n as an ordered sum of 10 primes. A340966

Numbers k such that numerator of Bernoulli(2·k) is divisible by 233, the ninth irregular prime. A92228

a(n) = n·Fibonacci(n-2) + ((-1)ⁿ + 1)/2. A323812