Base | Representation |
---|---|
bin | 101110101101100000… |
… | …0111010010101100000 |
3 | 100120220212020121210020 |
4 | 1131123000322111200 |
5 | 3120414132312113 |
6 | 114025441233440 |
7 | 10150543150140 |
oct | 1353300722540 |
9 | 316825217706 |
10 | 100311213408 |
11 | 395a607936a |
12 | 17536032880 |
13 | 95c81354a3 |
14 | 4bd8512920 |
15 | 2921711023 |
hex | 175b03a560 |
100311213408 has 48 divisors (see below), whose sum is σ = 300933642240. Its totient is φ = 28660346496.
The previous prime is 100311213407. The next prime is 100311213427. The reversal of 100311213408 is 804312113001.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100311213407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74635648 + ... + 74636991.
It is an arithmetic number, because the mean of its divisors is an integer number (6269450880).
Almost surely, 2100311213408 is an apocalyptic number.
It is an amenable number.
100311213408 is an abundant number, since it is smaller than the sum of its proper divisors (200622428832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100311213408 is a wasteful number, since it uses less digits than its factorization.
100311213408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149272659 (or 149272651 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 100311213408 its reverse (804312113001), we get a palindrome (904623326409).
The spelling of 100311213408 in words is "one hundred billion, three hundred eleven million, two hundred thirteen thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •