Base | Representation |
---|---|
bin | 10110110000110010101101… |
… | …101001001110100101110000 |
3 | 111010110102102210102102110122 |
4 | 112300302231221032211300 |
5 | 101110200300304014300 |
6 | 552525523144145412 |
7 | 30041465253212204 |
oct | 2660625551164560 |
9 | 433412383372418 |
10 | 100110011001200 |
11 | 29997465390692 |
12 | b289ba8168268 |
13 | 43b24449c5325 |
14 | 1aa14c965ab04 |
15 | b8915783bc85 |
hex | 5b0cada4e970 |
100110011001200 has 30 divisors (see below), whose sum is σ = 240514301431344. Its totient is φ = 40044004400320.
The previous prime is 100110011001181. The next prime is 100110011001211. The reversal of 100110011001200 is 2100110011001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (8).
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 5 ways as a sum of consecutive naturals, for example, 125137513352 + ... + 125137514151.
Almost surely, 2100110011001200 is an apocalyptic number.
100110011001200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100110011001200 is an abundant number, since it is smaller than the sum of its proper divisors (140404290430144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100110011001200 is a wasteful number, since it uses less digits than its factorization.
100110011001200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250275027521 (or 250275027510 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 100110011001200 its reverse (2100110011001), we get a palindrome (102210121012201).
The spelling of 100110011001200 in words is "one hundred trillion, one hundred ten billion, eleven million, one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •