Search a number
-
+
151362032635 = 51113720087861
BaseRepresentation
bin1000110011110111100…
…0010101001111111011
3112110200200100221101201
42030331320111033323
54434442140021020
6153311301355031
713635615022612
oct2147570251773
9473620327351
10151362032635
1159212a15460
1225402a08a77
13113727c6628
14747c61c879
153e0d474a0a
hex233de153fb

151362032635 has 16 divisors (see below), whose sum is σ = 199592996832. Its totient is φ = 109277958400.

The previous prime is 151362032621. The next prime is 151362032651. The reversal of 151362032635 is 536230263151.

It is not a de Polignac number, because 151362032635 - 217 = 151361901563 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 151362032594 and 151362032603.

It is an unprimeable number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10036396 + ... + 10051465.

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

Almost surely, 2151362032635 is an apocalyptic number.

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

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

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

The sum of its prime factors is 20088014.

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

Adding to 151362032635 its reverse (536230263151), we get a palindrome (687592295786).

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

Divisors: 1 5 11 55 137 685 1507 7535 20087861 100439305 220966471 1104832355 2752036957 13760184785 30272406527 151362032635