Search a number
-
+
10100556010011 = 36827493167131
BaseRepresentation
bin1001001011111011100000…
…0011011001001000011011
31022202121022010002211102110
42102332320003121020123
52310441414314310021
633252044213203403
72061512123335245
oct222767003311033
938677263084373
1010100556010011
113244692601725
12117167b930563
1358362ac00b6c
1426cc25d65095
15127b12dab476
hex92fb80d921b

10100556010011 has 8 divisors (see below), whose sum is σ = 13469380709184. Its totient is φ = 6732717658760.

The previous prime is 10100556009977. The next prime is 10100556010073. The reversal of 10100556010011 is 11001065500101.

It is a happy number.

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 10100556010011 - 210 = 10100556008987 is a prime.

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

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 246563085 + ... + 246604046.

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

Almost surely, 210100556010011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 493173961.

The product of its (nonzero) digits is 150, while the sum is 21.

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

Divisors: 1 3 6827 20481 493167131 1479501393 3366852003337 10100556010011