Base | Representation |
---|---|
bin | 11110010000110111001000… |
… | …011011010000011100111101 |
3 | 122110021020122002211222001021 |
4 | 132100313020123100130331 |
5 | 114421203003123433341 |
6 | 1151025202124144141 |
7 | 40015110442034323 |
oct | 3620671033203475 |
9 | 573236562758037 |
10 | 133100104124221 |
11 | 39456489958083 |
12 | 12b17837698051 |
13 | 5936394350590 |
14 | 24c2117c9bd13 |
15 | 105c38c2439d1 |
hex | 790dc86d073d |
133100104124221 has 8 divisors (see below), whose sum is σ = 143504667048960. Its totient is φ = 122719268824752.
The previous prime is 133100104124219. The next prime is 133100104124227. The reversal of 133100104124221 is 122421401001331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133100104124221 - 21 = 133100104124219 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133100104124227) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5931894661 + ... + 5931917098.
It is an arithmetic number, because the mean of its divisors is an integer number (17938083381120).
Almost surely, 2133100104124221 is an apocalyptic number.
It is an amenable number.
133100104124221 is a deficient number, since it is larger than the sum of its proper divisors (10404562924739).
133100104124221 is a wasteful number, since it uses less digits than its factorization.
133100104124221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11863812635.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 133100104124221 its reverse (122421401001331), we get a palindrome (255521505125552).
The spelling of 133100104124221 in words is "one hundred thirty-three trillion, one hundred billion, one hundred four million, one hundred twenty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •