Base | Representation |
---|---|
bin | 11110001111101111010101… |
… | …011001110001000101111011 |
3 | 122102222212122110012221012222 |
4 | 132033233111121301011323 |
5 | 114413422112140113412 |
6 | 1150525532301354255 |
7 | 40006411153311056 |
oct | 3617572531610573 |
9 | 572885573187188 |
10 | 133023012426107 |
11 | 39426819680281 |
12 | 12b0490186898b |
13 | 592c02990516b |
14 | 24bc4c3499a9d |
15 | 105a379254072 |
hex | 78fbd567117b |
133023012426107 has 4 divisors (see below), whose sum is σ = 133023284138040. Its totient is φ = 133022740714176.
The previous prime is 133023012426089. The next prime is 133023012426119. The reversal of 133023012426107 is 701624210320331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 133023012426107 - 212 = 133023012422011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133023012426127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 135120278 + ... + 136101195.
It is an arithmetic number, because the mean of its divisors is an integer number (33255821034510).
Almost surely, 2133023012426107 is an apocalyptic number.
133023012426107 is a deficient number, since it is larger than the sum of its proper divisors (271711933).
133023012426107 is an equidigital number, since it uses as much as digits as its factorization.
133023012426107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271711932.
The product of its (nonzero) digits is 36288, while the sum is 35.
Adding to 133023012426107 its reverse (701624210320331), we get a palindrome (834647222746438).
The spelling of 133023012426107 in words is "one hundred thirty-three trillion, twenty-three billion, twelve million, four hundred twenty-six thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •