Base | Representation |
---|---|
bin | 11011010110111011101001… |
… | …011111001111011010111100 |
3 | 120210000210000212222020220002 |
4 | 123112323221133033122330 |
5 | 111232333233031023400 |
6 | 1103523403334013432 |
7 | 34226026233255311 |
oct | 3326735137173274 |
9 | 523023025866802 |
10 | 120323131111100 |
11 | 3537a831770655 |
12 | 115b35191a7278 |
13 | 521a565531b68 |
14 | 219d95626cd08 |
15 | dd9d328c1ed5 |
hex | 6d6ee97cf6bc |
120323131111100 has 36 divisors (see below), whose sum is σ = 261109344849024. Its totient is φ = 48127750078080.
The previous prime is 120323131111061. The next prime is 120323131111133. The reversal of 120323131111100 is 1111131323021.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 15557249 + ... + 21969848.
Almost surely, 2120323131111100 is an apocalyptic number.
120323131111100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120323131111100 is an abundant number, since it is smaller than the sum of its proper divisors (140786213737924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120323131111100 is a wasteful number, since it uses less digits than its factorization.
120323131111100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37559174 (or 37559167 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 120323131111100 its reverse (1111131323021), we get a palindrome (121434262434121).
The spelling of 120323131111100 in words is "one hundred twenty trillion, three hundred twenty-three billion, one hundred thirty-one million, one hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •