Search a number
-
+
15150101501046 = 2317148530406873
BaseRepresentation
bin1101110001110110100001…
…1010110001010001110110
31222122100001121210200101010
43130131220122301101312
53441204401441013141
652115505513413050
73122362431664221
oct334355032612166
958570047720333
1015150101501046
114911138375996
12184823640a186
1385b857819a15
143a53a99285b8
151b41500e3416
hexdc7686b1476

15150101501046 has 16 divisors (see below), whose sum is σ = 32082567884784. Its totient is φ = 4752973019904.

The previous prime is 15150101501027. The next prime is 15150101501071. The reversal of 15150101501046 is 64010510105151.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 215150101501046 is an apocalyptic number.

15150101501046 is an abundant number, since it is smaller than the sum of its proper divisors (16932466383738).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 148530406895.

The product of its (nonzero) digits is 3000, while the sum is 30.

Adding to 15150101501046 its reverse (64010510105151), we get a palindrome (79160611606197).

The spelling of 15150101501046 in words is "fifteen trillion, one hundred fifty billion, one hundred one million, five hundred one thousand, forty-six".

Divisors: 1 2 3 6 17 34 51 102 148530406873 297060813746 445591220619 891182441238 2525016916841 5050033833682 7575050750523 15150101501046