Cookie Consent by FreePrivacyPolicy.com
Search a number
-
+
1469 = 13113
BaseRepresentation
bin10110111101
32000102
4112331
521334
610445
74166
oct2675
92012
101469
111116
12a25
13890
1476d
1567e
hex5bd

1469 has 4 divisors (see below), whose sum is σ = 1596. Its totient is φ = 1344.

The previous prime is 1459. The next prime is 1471. The reversal of 1469 is 9641.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 9641 = 31311.

It can be written as a sum of positive squares in 2 ways, for example, as 100 + 1369 = 10^2 + 37^2 .

It is a cyclic number.

It is not a de Polignac number, because 1469 - 24 = 1453 is a prime.

It is a super-2 number, since 2×14692 = 4315922, which contains 22 as substring.

It is a Duffinian number.

It is a Curzon number.

It is a plaindrome in base 10, base 11, base 15 and base 16.

It is a self number, because there is not a number n which added to its sum of digits gives 1469.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1409) by changing a digit.

It is an upside-down number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44 + ... + 69.

It is an arithmetic number, because the mean of its divisors is an integer number (399).

It is an amenable number.

1469 is a deficient number, since it is larger than the sum of its proper divisors (127).

1469 is a wasteful number, since it uses less digits than its factorization.

1469 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 126.

The product of its digits is 216, while the sum is 20.

The square root of 1469 is about 38.3275357935. The cubic root of 1469 is about 11.3677347641.

The spelling of 1469 in words is "one thousand, four hundred sixty-nine".

Divisors: 1 13 113 1469