Base | Representation |
---|---|
bin | 10110101111001100100100… |
… | …001001011101001001010111 |
3 | 111010001221022221021211120121 |
4 | 112233030210021131021113 |
5 | 101101401133440324343 |
6 | 552403303432012411 |
7 | 30030533254165135 |
oct | 2657144411351127 |
9 | 433057287254517 |
10 | 100000330011223 |
11 | 299549a1319524 |
12 | b270898231107 |
13 | 43a4cb5620b65 |
14 | 1a9a082998755 |
15 | b8638875aaed |
hex | 5af32425d257 |
100000330011223 has 8 divisors (see below), whose sum is σ = 100008125013888. Its totient is φ = 99992535357624.
The previous prime is 100000330011203. The next prime is 100000330011229. The reversal of 100000330011223 is 322110033000001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100000330011223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100000330011197 and 100000330011206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100000330011229) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 879275640 + ... + 879389362.
It is an arithmetic number, because the mean of its divisors is an integer number (12501015626736).
Almost surely, 2100000330011223 is an apocalyptic number.
100000330011223 is a deficient number, since it is larger than the sum of its proper divisors (7795002665).
100000330011223 is a wasteful number, since it uses less digits than its factorization.
100000330011223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 174533.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 100000330011223 its reverse (322110033000001), we get a palindrome (422110363011224).
The spelling of 100000330011223 in words is "one hundred trillion, three hundred thirty million, eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •