Search a number
-
+
156136970915 = 5233134023151
BaseRepresentation
bin1001000101101001111…
…1010001101010100011
3112221000110020221022122
42101122133101222203
510024232031032130
6155421153054455
714165135232512
oct2213237215243
9487013227278
10156136970915
1160243282242
1226315b5742b
1311953b348b3
1477b2856679
1540dc7712e5
hex245a7d1aa3

156136970915 has 8 divisors (see below), whose sum is σ = 188168505408. Its totient is φ = 124373483200.

The previous prime is 156136970881. The next prime is 156136970929. The reversal of 156136970915 is 519079631651.

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

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

It is not a de Polignac number, because 156136970915 - 26 = 156136970851 is a prime.

It is a Duffinian number.

It is an unprimeable number.

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

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

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

Almost surely, 2156136970915 is an apocalyptic number.

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

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

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

The sum of its prime factors is 134023389.

The product of its (nonzero) digits is 1530900, while the sum is 53.

The spelling of 156136970915 in words is "one hundred fifty-six billion, one hundred thirty-six million, nine hundred seventy thousand, nine hundred fifteen".

Divisors: 1 5 233 1165 134023151 670115755 31227394183 156136970915