Search a number
-
+
151691023 = 1113790093
BaseRepresentation
bin10010000101010…
…01111100001111
3101120102200222001
421002221330033
5302313103043
623015133131
73521231611
oct1102517417
9346380861
10151691023
1178697790
12429741a7
1325571803
1416208db1
15d4b574d
hex90a9f0f

151691023 has 4 divisors (see below), whose sum is σ = 165481128. Its totient is φ = 137900920.

The previous prime is 151690997. The next prime is 151691027. The reversal of 151691023 is 320196151.

151691023 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.

It is a cyclic number.

It is not a de Polignac number, because 151691023 - 217 = 151559951 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 151690982 and 151691000.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (151691027) 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, 6895036 + ... + 6895057.

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

Almost surely, 2151691023 is an apocalyptic number.

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

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

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

The sum of its prime factors is 13790104.

The product of its (nonzero) digits is 1620, while the sum is 28.

The square root of 151691023 is about 12316.2909595381. The cubic root of 151691023 is about 533.3184727196.

The spelling of 151691023 in words is "one hundred fifty-one million, six hundred ninety-one thousand, twenty-three".

Divisors: 1 11 13790093 151691023