Search a number
-
+
15151561163 = 15796506759
BaseRepresentation
bin11100001110001101…
…00111100111001011
31110002221100001111222
432013012213213023
5222012244424123
610543250312255
71044320100464
oct160706474713
943087301458
1015151561163
116475730182
122b2a28868b
13157607370b
14a3a3d7d6b
155da2a16c8
hex3871a79cb

15151561163 has 4 divisors (see below), whose sum is σ = 15248068080. Its totient is φ = 15055054248.

The previous prime is 15151561129. The next prime is 15151561171. The reversal of 15151561163 is 36116515151.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-15151561163 is a prime.

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

It is a Duffinian number.

It is a zygodrome in base 3.

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

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 3 ways as a sum of consecutive naturals, for example, 48253223 + ... + 48253536.

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

Almost surely, 215151561163 is an apocalyptic number.

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

15151561163 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 96506916.

The product of its digits is 13500, while the sum is 35.

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

Divisors: 1 157 96506759 15151561163