Base | Representation |
---|---|
bin | 101110101000001001… |
… | …0010010111001101111 |
3 | 100120110022120001202120 |
4 | 1131100102102321233 |
5 | 3120032043033403 |
6 | 113555531324023 |
7 | 10143226223214 |
oct | 1352022227157 |
9 | 316408501676 |
10 | 100131221103 |
11 | 395135114a1 |
12 | 174a58b0613 |
13 | 9599a64c74 |
14 | 4bbc65bb0b |
15 | 2910a09e53 |
hex | 1750492e6f |
100131221103 has 8 divisors (see below), whose sum is σ = 137116627248. Its totient is φ = 64949981184.
The previous prime is 100131221101. The next prime is 100131221117. The reversal of 100131221103 is 301122131001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100131221103 - 21 = 100131221101 is a prime.
It is a super-2 number, since 2×1001312211032 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100131221101) 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 7 ways as a sum of consecutive naturals, for example, 451041426 + ... + 451041647.
It is an arithmetic number, because the mean of its divisors is an integer number (17139578406).
Almost surely, 2100131221103 is an apocalyptic number.
100131221103 is a deficient number, since it is larger than the sum of its proper divisors (36985406145).
100131221103 is an equidigital number, since it uses as much as digits as its factorization.
100131221103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 902083113.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 100131221103 its reverse (301122131001), we get a palindrome (401253352104).
The spelling of 100131221103 in words is "one hundred billion, one hundred thirty-one million, two hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •