Base | Representation |
---|---|
bin | 11110001111011111100110… |
… | …101110001100100100001101 |
3 | 122102221021001102000112122112 |
4 | 132033133212232030210031 |
5 | 114413133020010000010 |
6 | 1150514100333153405 |
7 | 40005242502522134 |
oct | 3617374656144415 |
9 | 572837042015575 |
10 | 133006123125005 |
11 | 3941a642050399 |
12 | 12b0158962b865 |
13 | 592a567830280 |
14 | 24bb76039491b |
15 | 1059bdb646a05 |
hex | 78f7e6b8c90d |
133006123125005 has 8 divisors (see below), whose sum is σ = 171884836038552. Its totient is φ = 98219906307648.
The previous prime is 133006123124951. The next prime is 133006123125019. The reversal of 133006123125005 is 500521321600331.
It can be written as a sum of positive squares in 4 ways, for example, as 8347580651524 + 124658542473481 = 2889218^2 + 11165059^2 .
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 133006123125005 - 222 = 133006118930701 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1023124023974 + ... + 1023124024103.
It is an arithmetic number, because the mean of its divisors is an integer number (21485604504819).
Almost surely, 2133006123125005 is an apocalyptic number.
It is an amenable number.
133006123125005 is a deficient number, since it is larger than the sum of its proper divisors (38878712913547).
133006123125005 is a wasteful number, since it uses less digits than its factorization.
133006123125005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2046248048095.
The product of its (nonzero) digits is 16200, while the sum is 32.
Adding to 133006123125005 its reverse (500521321600331), we get a palindrome (633527444725336).
The spelling of 133006123125005 in words is "one hundred thirty-three trillion, six billion, one hundred twenty-three million, one hundred twenty-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •