Base | Representation |
---|---|
bin | 11110010010111001110101… |
… | …001011111000001011111001 |
3 | 122110202122212110101112112112 |
4 | 132102321311023320023321 |
5 | 114431002411011121010 |
6 | 1151213451441222105 |
7 | 40031206231060526 |
oct | 3622716513701371 |
9 | 573678773345475 |
10 | 133240441504505 |
11 | 394aaa54726aa5 |
12 | 12b3aa82331935 |
13 | 594669aa9a67a |
14 | 24c8c2c23014d |
15 | 1060d528a9a05 |
hex | 792e752f82f9 |
133240441504505 has 4 divisors (see below), whose sum is σ = 159888529805412. Its totient is φ = 106592353203600.
The previous prime is 133240441504463. The next prime is 133240441504591. The reversal of 133240441504505 is 505405144042331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 54599212600384 + 78641228904121 = 7389128^2 + 8867989^2 .
It is not a de Polignac number, because 133240441504505 - 28 = 133240441504249 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13324044150446 + ... + 13324044150455.
It is an arithmetic number, because the mean of its divisors is an integer number (39972132451353).
Almost surely, 2133240441504505 is an apocalyptic number.
It is an amenable number.
133240441504505 is a deficient number, since it is larger than the sum of its proper divisors (26648088300907).
133240441504505 is an equidigital number, since it uses as much as digits as its factorization.
133240441504505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26648088300906.
The product of its (nonzero) digits is 576000, while the sum is 41.
Adding to 133240441504505 its reverse (505405144042331), we get a palindrome (638645585546836).
The spelling of 133240441504505 in words is "one hundred thirty-three trillion, two hundred forty billion, four hundred forty-one million, five hundred four thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •