Search a number
-
+
100101011010100 = 22521767786976289
BaseRepresentation
bin10110110000101010010101…
…001100111111001000110100
3111010102120012120100111122221
4112300222111030333020310
5101110023332304310400
6552521434123132124
730041026240436122
oct2660522514771064
9433376176314587
10100101011010100
11299936670a6111
12b2882b6074044
1343b163c2490c9
141aa0cb4248912
15b88ccc662c1a
hex5b0a9533f234

100101011010100 has 72 divisors (see below), whose sum is σ = 230336525565720. Its totient is φ = 37629421240320.

The previous prime is 100101011010079. The next prime is 100101011010107. The reversal of 100101011010100 is 1010110101001.

It is a happy number.

It can be written as a sum of positive squares in 12 ways, for example, as 961113572496 + 99139897437604 = 980364^2 + 9956902^2 .

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 42337245 + ... + 44639044.

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

Almost surely, 2100101011010100 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

Adding to 100101011010100 its reverse (1010110101001), we get a palindrome (101111121111101).

Subtracting from 100101011010100 its reverse (1010110101001), we obtain a palindrome (99090900909099).

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

Divisors: 1 2 4 5 10 17 20 25 34 50 68 85 100 170 340 425 677 850 1354 1700 2708 3385 6770 11509 13540 16925 23018 33850 46036 57545 67700 115090 230180 287725 575450 1150900 86976289 173952578 347905156 434881445 869762890 1478596913 1739525780 2174407225 2957193826 4348814450 5914387652 7392984565 8697628900 14785969130 29571938260 36964922825 58882947653 73929845650 117765895306 147859691300 235531790612 294414738265 588829476530 1001010110101 1177658953060 1472073691325 2002020220202 2944147382650 4004040440404 5005050550505 5888294765300 10010101101010 20020202202020 25025252752525 50050505505050 100101011010100