Base | Representation |
---|---|
bin | 101110101010010010… |
… | …0111101000010000011 |
3 | 100120122100001001012222 |
4 | 1131110210331002003 |
5 | 3120204011033443 |
6 | 114011022441255 |
7 | 10145062216625 |
oct | 1352444750203 |
9 | 316570031188 |
10 | 100203221123 |
11 | 39550119145 |
12 | 17505a3322b |
13 | 95ab953c25 |
14 | 4bc8040c15 |
15 | 2916ecd468 |
hex | 175493d083 |
100203221123 has 8 divisors (see below), whose sum is σ = 106186762080. Its totient is φ = 94388230720.
The previous prime is 100203221093. The next prime is 100203221233. The reversal of 100203221123 is 321122302001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100203221123 - 226 = 100136112259 is a prime.
It is a super-2 number, since 2×1002032211232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100203224123) 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, 42136415 + ... + 42138792.
It is an arithmetic number, because the mean of its divisors is an integer number (13273345260).
Almost surely, 2100203221123 is an apocalyptic number.
100203221123 is a deficient number, since it is larger than the sum of its proper divisors (5983540957).
100203221123 is an equidigital number, since it uses as much as digits as its factorization.
100203221123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84275277.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 100203221123 its reverse (321122302001), we get a palindrome (421325523124).
The spelling of 100203221123 in words is "one hundred billion, two hundred three million, two hundred twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •