Base | Representation |
---|---|
bin | 11110001111110010001000… |
… | …010000001010101110100111 |
3 | 122110000011101120101110202221 |
4 | 132033302020100022232213 |
5 | 114413444233314000320 |
6 | 1150531150131013211 |
7 | 40006545420114214 |
oct | 3617621020125647 |
9 | 573004346343687 |
10 | 133026013031335 |
11 | 39428019414406 |
12 | 12b053ba73a207 |
13 | 592c3b746c008 |
14 | 24bc6c9bbcb0b |
15 | 105a4a28b73aa |
hex | 78fc8840aba7 |
133026013031335 has 16 divisors (see below), whose sum is σ = 159752311992000. Its totient is φ = 106340086192896.
The previous prime is 133026013031321. The next prime is 133026013031341. The reversal of 133026013031335 is 533130310620331.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133026013031335 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133026013031335.
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 15 ways as a sum of consecutive naturals, for example, 164040987 + ... + 164849923.
It is an arithmetic number, because the mean of its divisors is an integer number (9984519499500).
Almost surely, 2133026013031335 is an apocalyptic number.
133026013031335 is a deficient number, since it is larger than the sum of its proper divisors (26726298960665).
133026013031335 is a wasteful number, since it uses less digits than its factorization.
133026013031335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 833850.
The product of its (nonzero) digits is 43740, while the sum is 34.
Adding to 133026013031335 its reverse (533130310620331), we get a palindrome (666156323651666).
The spelling of 133026013031335 in words is "one hundred thirty-three trillion, twenty-six billion, thirteen million, thirty-one thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •