Search a number
-
+
100002011010010 = 2571140847902831
BaseRepresentation
bin10110101111001110001000…
…010101111101001111011010
3111010002002200002101102101221
4112233032020111331033122
5101101413104304310020
6552404142321402254
730030623025351214
oct2657161025751732
9433062602342357
10100002011010010
112995568419381a
12b27108719938a
1343a51c29767b5
141a9a1a1d355b4
15b864361096aa
hex5af38857d3da

100002011010010 has 16 divisors (see below), whose sum is σ = 182538882070272. Its totient is φ = 39437412792400.

The previous prime is 100002011009959. The next prime is 100002011010043. The reversal of 100002011010010 is 10010110200001.

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

It is a junction number, because it is equal to n+sod(n) for n = 100002011009975 and 100002011010002.

It is an unprimeable number.

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

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

Almost surely, 2100002011010010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 140847902909.

The product of its (nonzero) digits is 2, while the sum is 7.

Adding to 100002011010010 its reverse (10010110200001), we get a palindrome (110012121210011).

The spelling of 100002011010010 in words is "one hundred trillion, two billion, eleven million, ten thousand, ten".

Divisors: 1 2 5 10 71 142 355 710 140847902831 281695805662 704239514155 1408479028310 10000201101001 20000402202002 50001005505005 100002011010010