Base | Representation |
---|---|
bin | 11110001111110010001000… |
… | …001110101110000000001011 |
3 | 122110000011101112200011210010 |
4 | 132033302020032232000023 |
5 | 114413444233214322111 |
6 | 1150531150114523003 |
7 | 40006545413643006 |
oct | 3617621016560013 |
9 | 573004345604703 |
10 | 133026012651531 |
11 | 3942801918501a |
12 | 12b053ba596463 |
13 | 592c3b736818c |
14 | 24bc6c9b2053d |
15 | 105a4a283eaa6 |
hex | 78fc883ae00b |
133026012651531 has 8 divisors (see below), whose sum is σ = 177368165121024. Its totient is φ = 88683934308200.
The previous prime is 133026012651487. The next prime is 133026012651619. The reversal of 133026012651531 is 135156210620331.
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 133026012651531 - 211 = 133026012649483 is a prime.
It is a super-2 number, since 2×1330260126515312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 133026012651531.
It is not an unprimeable number, because it can be changed into a prime (133026012651731) 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, 14199495 + ... + 21625856.
It is an arithmetic number, because the mean of its divisors is an integer number (22171020640128).
Almost surely, 2133026012651531 is an apocalyptic number.
133026012651531 is a deficient number, since it is larger than the sum of its proper divisors (44342152469493).
133026012651531 is a wasteful number, since it uses less digits than its factorization.
133026012651531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37063081.
The product of its (nonzero) digits is 97200, while the sum is 39.
The spelling of 133026012651531 in words is "one hundred thirty-three trillion, twenty-six billion, twelve million, six hundred fifty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •