Search a number
-
+
101000000010100 = 22521012354127961
BaseRepresentation
bin10110111101101111100101…
…000111110111011101110100
3111020121111122122202110121211
4112331233211013313131310
5101214241000000310400
6554450432013251204
730163003104032602
oct2675574507673564
9436544578673554
10101000000010100
112a1aa94aa39714
12b3b2587793b04
13444834a416259
141ad25d725c872
15ba2396038dba
hex5bdbe51f7774

101000000010100 has 108 divisors (see below), whose sum is σ = 221431918034404. Its totient is φ = 39987273600000.

The previous prime is 101000000010017. The next prime is 101000000010101. The reversal of 101000000010100 is 1010000000101.

It can be written as a sum of positive squares in 18 ways, for example, as 25167740428516 + 75832259581584 = 5016746^2 + 8708172^2 .

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101000000010101) 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 35 ways as a sum of consecutive naturals, for example, 3612160120 + ... + 3612188080.

Almost surely, 2101000000010100 is an apocalyptic number.

101000000010100 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 101000000010100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (110715959017202).

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

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

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

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

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

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

Adding to 101000000010100 its reverse (1010000000101), we get a palindrome (102010000010201).

Subtracting from 101000000010100 its reverse (1010000000101), we obtain a palindrome (99990000009999).

101000000010100 divided by its reverse (1010000000101) gives a square (100 = 102).

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

Divisors: 1 2 4 5 10 20 25 50 100 101 202 404 505 1010 2020 2525 3541 5050 7082 10100 10201 14164 17705 20402 27961 35410 40804 51005 55922 70820 88525 102010 111844 139805 177050 204020 255025 279610 354100 357641 510050 559220 699025 715282 1020100 1398050 1430564 1788205 2796100 2824061 3576410 5648122 7152820 8941025 11296244 14120305 17882050 28240610 35764100 36121741 56481220 70601525 72243482 99009901 141203050 144486964 180608705 198019802 282406100 285230161 361217410 396039604 495049505 570460322 722434820 903043525 990099010 1140920644 1426150805 1806087050 1980198020 2475247525 2852301610 3612174100 4950495050 5704603220 7130754025 9900990100 10000000001 14261508050 20000000002 28523016100 40000000004 50000000005 100000000010 200000000020 250000000025 500000000050 1000000000100 1010000000101 2020000000202 4040000000404 5050000000505 10100000001010 20200000002020 25250000002525 50500000005050 101000000010100