Base | Representation |
---|---|
bin | 101110100111110111… |
… | …1001010000110010000 |
3 | 100120102200020002111121 |
4 | 1131033233022012100 |
5 | 3120022213310000 |
6 | 113555002052024 |
7 | 10143055020535 |
oct | 1351757120620 |
9 | 316380202447 |
10 | 100122010000 |
11 | 395092a0011 |
12 | 174a27aa014 |
13 | 9597b8b4cc |
14 | 4bbb340d8c |
15 | 290ecdab1a |
hex | 174fbca190 |
100122010000 has 100 divisors (see below), whose sum is σ = 256664975292. Its totient is φ = 37692928000.
The previous prime is 100122009989. The next prime is 100122010003. The reversal of 100122010000 is 10221001.
It can be written as a sum of positive squares in 10 ways, for example, as 81147498496 + 18974511504 = 284864^2 + 137748^2 .
It is a tau number, because it is divible by the number of its divisors (100).
It is not an unprimeable number, because it can be changed into a prime (100122010003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 124477 + ... + 464476.
Almost surely, 2100122010000 is an apocalyptic number.
100122010000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100122010000 is an abundant number, since it is smaller than the sum of its proper divisors (156542965292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100122010000 is an equidigital number, since it uses as much as digits as its factorization.
100122010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 588998 (or 588977 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 100122010000 its reverse (10221001), we get a palindrome (100132231001).
The spelling of 100122010000 in words is "one hundred billion, one hundred twenty-two million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •