Base | Representation |
---|---|
bin | 10110101111001100100010… |
… | …010111011110101011101111 |
3 | 111010001221020212001212111120 |
4 | 112233030202113132223233 |
5 | 101101401103313224403 |
6 | 552403300443352023 |
7 | 30030532442214666 |
oct | 2657144227365357 |
9 | 433057225055446 |
10 | 100000300133103 |
11 | 29954986471667 |
12 | b27088a222613 |
13 | 43a4cac38c4b6 |
14 | 1a9a07ca1bddd |
15 | b86385d07e53 |
hex | 5af3225deaef |
100000300133103 has 8 divisors (see below), whose sum is σ = 135160223011248. Its totient is φ = 65753622005184.
The previous prime is 100000300133099. The next prime is 100000300133191. The reversal of 100000300133103 is 301331003000001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100000300133103 - 22 = 100000300133099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100000300131103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 228311187300 + ... + 228311187737.
It is an arithmetic number, because the mean of its divisors is an integer number (16895027876406).
Almost surely, 2100000300133103 is an apocalyptic number.
100000300133103 is a deficient number, since it is larger than the sum of its proper divisors (35159922878145).
100000300133103 is an equidigital number, since it uses as much as digits as its factorization.
100000300133103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 456622375113.
The product of its (nonzero) digits is 81, while the sum is 15.
Adding to 100000300133103 its reverse (301331003000001), we get a palindrome (401331303133104).
The spelling of 100000300133103 in words is "one hundred trillion, three hundred million, one hundred thirty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •