Search a number
-
+
10000551010010 = 251190914100091
BaseRepresentation
bin1001000110000110111101…
…0010100101111011011010
31022102001011121001110110112
42101201233102211323122
52302322112024310020
633134104551044322
72051341656013421
oct221415722457332
938361147043415
1010000551010010
113206234370aa0
1211562103706a2
13577081360652
1426805a3a22b8
1512520d4d52c5
hex9186f4a5eda

10000551010010 has 16 divisors (see below), whose sum is σ = 19637445619872. Its totient is φ = 3636564003600.

The previous prime is 10000551009847. The next prime is 10000551010027. The reversal of 10000551010010 is 1001015500001.

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

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, 45457049936 + ... + 45457050155.

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

Almost surely, 210000551010010 is an apocalyptic number.

10000551010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 90914100109.

The product of its (nonzero) digits is 25, while the sum is 14.

Adding to 10000551010010 its reverse (1001015500001), we get a palindrome (11001566510011).

The spelling of 10000551010010 in words is "ten trillion, five hundred fifty-one million, ten thousand, ten".

Divisors: 1 2 5 10 11 22 55 110 90914100091 181828200182 454570500455 909141000910 1000055101001 2000110202002 5000275505005 10000551010010