Search a number
-
+
151309992961 = 1361111175601
BaseRepresentation
bin1000110011101011000…
…1110100010000000001
3112110120001110001101101
42030322301310100001
54434340324233321
6153302202134401
713634413501501
oct2147261642001
9473501401341
10151309992961
1159196601266
12253a94b1401
1311364aa5a1a
147475753a01
153e08ae5791
hex233ac74401

151309992961 has 4 divisors (see below), whose sum is σ = 151421169924. Its totient is φ = 151198816000.

The previous prime is 151309992937. The next prime is 151309992973. The reversal of 151309992961 is 169299903151.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 59161319361 + 92148673600 = 243231^2 + 303560^2 .

It is a cyclic number.

It is not a de Polignac number, because 151309992961 - 27 = 151309992833 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2151309992961 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 111176962.

The product of its (nonzero) digits is 1180980, while the sum is 55.

The spelling of 151309992961 in words is "one hundred fifty-one billion, three hundred nine million, nine hundred ninety-two thousand, nine hundred sixty-one".

Divisors: 1 1361 111175601 151309992961