Search a number
-
+
1010110002000 = 243531134943853
BaseRepresentation
bin11101011001011110011…
…11110111001101010000
310120120021022011201222120
432230233033313031100
5113022201130031000
62052012122534240
7132656316231351
oct16545717671520
93516238151876
101010110002000
1135a426843050
12143923967380
13743399bc248
1436c65041d28
151b41e1026a0
hexeb2f3f7350

1010110002000 has 320 divisors, whose sum is σ = 3562909459200. Its totient is φ = 244167936000.

The previous prime is 1010110001993. The next prime is 1010110002053. The reversal of 1010110002000 is 2000110101.

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

It is a Harshad number since it is a multiple of its sum of digits (6).

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 23012074 + ... + 23055926.

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

Almost surely, 21010110002000 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1010110002000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1781454729600).

1010110002000 is an abundant number, since it is smaller than the sum of its proper divisors (2552799457200).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

1010110002000 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 44239 (or 44223 counting only the distinct ones).

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

Adding to 1010110002000 its reverse (2000110101), we get a palindrome (1012110112101).

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