Search a number
-
+
10000000100110 = 254012493765611
BaseRepresentation
bin1001000110000100111001…
…1101000010011100001110
31022101222202012102100011011
42101201032131002130032
52302320000011200420
633133534151115434
72051322216242206
oct221411635023416
938358665370134
1010000000100110
113205a813a2259
121156097972b7a
13576cc4191c67
14268007157406
151251c9e6295a
hex9184e74270e

10000000100110 has 16 divisors (see below), whose sum is σ = 18044887968432. Its totient is φ = 3990024976000.

The previous prime is 10000000100107. The next prime is 10000000100263. The reversal of 10000000100110 is 1100100000001.

It is a self number, because there is not a number n which added to its sum of digits gives 10000000100110.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 210000000100110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 2493766019.

The product of its (nonzero) digits is 1, while the sum is 4.

Adding to 10000000100110 its reverse (1100100000001), we get a palindrome (11100100100111).

The spelling of 10000000100110 in words is "ten trillion, one hundred thousand, one hundred ten".

Divisors: 1 2 5 10 401 802 2005 4010 2493765611 4987531222 12468828055 24937656110 1000000010011 2000000020022 5000000050055 10000000100110