Search a number
-
+
156601012010455 = 5118332646852227
BaseRepresentation
bin100011100110110110000011…
…101100010011110111010111
3202112110220120210010212011201
4203212312003230103313113
5131011222333033313310
61313021302312213331
744662023031105435
oct4346660354236727
9675426523125151
10156601012010455
1145997130777691
12156923aa09a247
13694c54840a05c
142a9575aa45d55
151318841ed9e3a
hex8e6d83b13dd7

156601012010455 has 8 divisors (see below), whose sum is σ = 187937095596912. Its totient is φ = 125270222152128.

The previous prime is 156601012010431. The next prime is 156601012010459. The reversal of 156601012010455 is 554010210106651.

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 156601012010455 - 213 = 156601012002263 is a prime.

It is a super-2 number, since 2×1566010120104552 (a number of 29 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 2156601012010455 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2646864065.

The product of its (nonzero) digits is 36000, while the sum is 37.

The spelling of 156601012010455 in words is "one hundred fifty-six trillion, six hundred one billion, twelve million, ten thousand, four hundred fifty-five".

Divisors: 1 5 11833 59165 2646852227 13234261135 31320202402091 156601012010455