Base | Representation |
---|---|
bin | 10110110010001001011010… |
… | …011000001010101011001100 |
3 | 111010210022201120000012111021 |
4 | 112302021122120022223030 |
5 | 101113211423421102200 |
6 | 553040400431203524 |
7 | 30051302211541060 |
oct | 2662113230125314 |
9 | 433708646005437 |
10 | 100203103300300 |
11 | 29a22996583870 |
12 | b2a40486765a4 |
13 | 43bb15c377390 |
14 | 1aa5bdb109aa0 |
15 | b8b7a53e041a |
hex | 5b225a60aacc |
100203103300300 has 144 divisors (see below), whose sum is σ = 291948398606592. Its totient is φ = 28829664057600.
The previous prime is 100203103300283. The next prime is 100203103300327. The reversal of 100203103300300 is 3003301302001.
It is a super-2 number, since 2×1002031033003002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 500414902 + ... + 500615101.
It is an arithmetic number, because the mean of its divisors is an integer number (2027419434768).
Almost surely, 2100203103300300 is an apocalyptic number.
100203103300300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100203103300300 is an abundant number, since it is smaller than the sum of its proper divisors (191745295306292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100203103300300 is a wasteful number, since it uses less digits than its factorization.
100203103300300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001030048 (or 1001030041 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 16.
Adding to 100203103300300 its reverse (3003301302001), we get a palindrome (103206404602301).
The spelling of 100203103300300 in words is "one hundred trillion, two hundred three billion, one hundred three million, three hundred thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •