Search a number
-
+
1010566500151 = 13303192563933
BaseRepresentation
bin11101011010010100111…
…01010000111100110111
310120121110010011020201111
432231022131100330313
5113024120011001101
62052125311135451
7133003531343635
oct16551235207467
93517403136644
101010566500151
1135a64049794a
12143a30814587
13743b04528b0
1436ca9912355
151b449226251
hexeb4a750f37

1010566500151 has 8 divisors (see below), whose sum is σ = 1088338704320. Its totient is φ = 932799484512.

The previous prime is 1010566500113. The next prime is 1010566500161. The reversal of 1010566500151 is 1510056650101.

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 1010566500151 - 27 = 1010566500023 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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, 887820 + ... + 1676113.

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

Almost surely, 21010566500151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2594265.

The product of its (nonzero) digits is 4500, while the sum is 31.

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

Divisors: 1 13 30319 394147 2563933 33331129 77735884627 1010566500151