Search a number
-
+
101000220110010 = 232513293498529293
BaseRepresentation
bin10110111101101111110010…
…001111011110110010111010
3111020121112012222220200221100
4112331233302033132302322
5101214241422322010020
6554450505514552230
730163011415613364
oct2675576217366272
9436545188820840
10101000220110010
112a1aaa531aaa71
12b3b2629438676
134448383bba2a0
141ad2618593d34
15ba23aa513a90
hex5bdbf23decba

101000220110010 has 192 divisors, whose sum is σ = 293390655012000. Its totient is φ = 23935513319424.

The previous prime is 101000220109991. The next prime is 101000220110011. The reversal of 101000220110010 is 10011022000101.

It is a happy number.

It can be written as a sum of positive squares in 16 ways, for example, as 210045306249 + 100790174803761 = 458307^2 + 10039431^2 .

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

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

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

It is a pernicious number, because its binary representation contains a prime number (31) of ones.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 7576924 + ... + 16106216.

Almost surely, 2101000220110010 is an apocalyptic number.

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

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

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

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

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

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

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

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

Adding to 101000220110010 its reverse (10011022000101), we get a palindrome (111011242110111).

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