Base | Representation |
---|---|
bin | 10110101111001101010011… |
… | …010011111111011100011100 |
3 | 111010002000101002020120212112 |
4 | 112233031103103333130130 |
5 | 101101404244023133200 |
6 | 552403514140053152 |
7 | 30030562003100201 |
oct | 2657152323773434 |
9 | 433060332216775 |
10 | 100001121302300 |
11 | 29955267a51199 |
12 | b270a792341b8 |
13 | 43a50b0544a2a |
14 | 1a9a119ad7ca8 |
15 | b863d2e62535 |
hex | 5af3534ff71c |
100001121302300 has 72 divisors (see below), whose sum is σ = 220567228835520. Its totient is φ = 39343387219200.
The previous prime is 100001121302263. The next prime is 100001121302309. The reversal of 100001121302300 is 3203121100001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100001121302309) 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 23 ways as a sum of consecutive naturals, for example, 193276346 + ... + 193793054.
Almost surely, 2100001121302300 is an apocalyptic number.
100001121302300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100001121302300 is an abundant number, since it is smaller than the sum of its proper divisors (120566107533220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100001121302300 is a wasteful number, since it uses less digits than its factorization.
100001121302300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 548511 (or 548504 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 100001121302300 its reverse (3203121100001), we get a palindrome (103204242402301).
The spelling of 100001121302300 in words is "one hundred trillion, one billion, one hundred twenty-one million, three hundred two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •