Base | Representation |
---|---|
bin | 10110101111101010111111… |
… | …100011001111010110011011 |
3 | 111010012001122220102100012210 |
4 | 112233222333203033112123 |
5 | 101102420042003310021 |
6 | 552430305434210203 |
7 | 30033101020455000 |
oct | 2657527743172633 |
9 | 433161586370183 |
10 | 100033002010011 |
11 | 29967837863814 |
12 | b277095b83963 |
13 | 43a80c1447415 |
14 | 1a9b8a1c278a7 |
15 | b8714bc37e76 |
hex | 5afabf8cf59b |
100033002010011 has 256 divisors, whose sum is σ = 177526702080000. Its totient is φ = 49763405260800.
The previous prime is 100033002010009. The next prime is 100033002010043. The reversal of 100033002010011 is 110010200330001.
It is not a de Polignac number, because 100033002010011 - 21 = 100033002010009 is a prime.
It is a super-2 number, since 2×1000330020100112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100033002050011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 26179794481 + ... + 26179798301.
It is an arithmetic number, because the mean of its divisors is an integer number (693463680000).
Almost surely, 2100033002010011 is an apocalyptic number.
100033002010011 is a deficient number, since it is larger than the sum of its proper divisors (77493700069989).
100033002010011 is a wasteful number, since it uses less digits than its factorization.
100033002010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6015 (or 6001 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 100033002010011 its reverse (110010200330001), we get a palindrome (210043202340012).
The spelling of 100033002010011 in words is "one hundred trillion, thirty-three billion, two million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •