Search a number
-
+
151402615365 = 3543234732737
BaseRepresentation
bin1000110100000001001…
…1001001001001000101
3112110210111201202102210
42031000103021021011
54440033032142430
6153315311254033
713636616665611
oct2150023111105
9473714652383
10151402615365
1159233913901
122541451a319
131137b035491
147483b84341
153e11cde2b0
hex23404c9245

151402615365 has 16 divisors (see below), whose sum is σ = 247877771328. Its totient is φ = 78870199296.

The previous prime is 151402615339. The next prime is 151402615369. The reversal of 151402615365 is 563516204151.

It is not a de Polignac number, because 151402615365 - 25 = 151402615333 is a prime.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (151402615369) 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 15 ways as a sum of consecutive naturals, for example, 117365724 + ... + 117367013.

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

Almost surely, 2151402615365 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 234732788.

The product of its (nonzero) digits is 108000, while the sum is 39.

The spelling of 151402615365 in words is "one hundred fifty-one billion, four hundred two million, six hundred fifteen thousand, three hundred sixty-five".

Divisors: 1 3 5 15 43 129 215 645 234732737 704198211 1173663685 3520991055 10093507691 30280523073 50467538455 151402615365