Search a number
-
+
151968913 = 317876229
BaseRepresentation
bin10010000111011…
…01110010010001
3101120221211011021
421003231302101
5302401001123
623025115441
73523500025
oct1103556221
9346854137
10151968913
1178867548
1242a88b81
132563b145
141627c385
15d51cc5d
hex90edc91

151968913 has 8 divisors (see below), whose sum is σ = 157095680. Its totient is φ = 146856240.

The previous prime is 151968911. The next prime is 151968917. The reversal of 151968913 is 319869151.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 151968913 - 21 = 151968911 is a prime.

It is a Duffinian number.

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

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21283 + ... + 27511.

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

Almost surely, 2151968913 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 7047.

The product of its digits is 58320, while the sum is 43.

The square root of 151968913 is about 12327.5671971399. The cubic root of 151968913 is about 533.6439445436.

It can be divided in two parts, 151968 and 913, that added together give a square (152881 = 3912).

The spelling of 151968913 in words is "one hundred fifty-one million, nine hundred sixty-eight thousand, nine hundred thirteen".

Divisors: 1 31 787 6229 24397 193099 4902223 151968913