Search a number
-
+
151069 = 197951
BaseRepresentation
bin100100111000011101
321200020011
4210320131
514313234
63123221
71166302
oct447035
9250204
10151069
11a3556
1273511
13539b9
143d0a9
152eb64
hex24e1d

151069 has 4 divisors (see below), whose sum is σ = 159040. Its totient is φ = 143100.

The previous prime is 151057. The next prime is 151091. The reversal of 151069 is 960151.

151069 = 802 + 812 + ... + 982.

151069 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 151069 - 211 = 149021 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

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

2151069 is an apocalyptic number.

151069 is a gapful number since it is divisible by the number (19) formed by its first and last digit.

It is an amenable number.

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

151069 is an equidigital number, since it uses as much as digits as its factorization.

151069 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 7970.

The product of its (nonzero) digits is 270, while the sum is 22.

The square root of 151069 is about 388.6759575791. The cubic root of 151069 is about 53.2588500209.

The spelling of 151069 in words is "one hundred fifty-one thousand, sixty-nine".

Divisors: 1 19 7951 151069