Base | Representation |
---|---|
bin | 11110010000110111000011… |
… | …100110010011001101001100 |
3 | 122110021020102110110011222120 |
4 | 132100313003212103031030 |
5 | 114421202321410224004 |
6 | 1151025150112212540 |
7 | 40015105436442324 |
oct | 3620670346231514 |
9 | 573236373404876 |
10 | 133100023133004 |
11 | 3945644816a194 |
12 | 12b1781453a150 |
13 | 5936380633c95 |
14 | 24c210b218284 |
15 | 105c3850963d9 |
hex | 790dc399334c |
133100023133004 has 12 divisors (see below), whose sum is σ = 310566720643704. Its totient is φ = 44366674377664.
The previous prime is 133100023132963. The next prime is 133100023133047. The reversal of 133100023133004 is 400331320001331.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
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 3 ways as a sum of consecutive naturals, for example, 5545834297197 + ... + 5545834297220.
It is an arithmetic number, because the mean of its divisors is an integer number (25880560053642).
Almost surely, 2133100023133004 is an apocalyptic number.
It is an amenable number.
133100023133004 is an abundant number, since it is smaller than the sum of its proper divisors (177466697510700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133100023133004 is a wasteful number, since it uses less digits than its factorization.
133100023133004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11091668594424 (or 11091668594422 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 133100023133004 its reverse (400331320001331), we get a palindrome (533431343134335).
The spelling of 133100023133004 in words is "one hundred thirty-three trillion, one hundred billion, twenty-three million, one hundred thirty-three thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •