Base | Representation |
---|---|
bin | 101110101011011110… |
… | …0110100110011011110 |
3 | 100120202002221201021102 |
4 | 1131112330310303132 |
5 | 3120244204031220 |
6 | 114015004033102 |
7 | 10146054503300 |
oct | 1352674646336 |
9 | 316662851242 |
10 | 100243033310 |
11 | 39570640682 |
12 | 17517232792 |
13 | 95b6c83134 |
14 | 4bcd445970 |
15 | 291a744775 |
hex | 1756f34cde |
100243033310 has 24 divisors (see below), whose sum is σ = 209896638120. Its totient is φ = 34369039824.
The previous prime is 100243033291. The next prime is 100243033333. The reversal of 100243033310 is 13330342001.
It is a super-2 number, since 2×1002430333102 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 102288320 + ... + 102289299.
It is an arithmetic number, because the mean of its divisors is an integer number (8745693255).
Almost surely, 2100243033310 is an apocalyptic number.
100243033310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100243033310 is an abundant number, since it is smaller than the sum of its proper divisors (109653604810).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100243033310 is a wasteful number, since it uses less digits than its factorization.
100243033310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204577640 (or 204577633 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 100243033310 its reverse (13330342001), we get a palindrome (113573375311).
The spelling of 100243033310 in words is "one hundred billion, two hundred forty-three million, thirty-three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •