Base | Representation |
---|---|
bin | 111110001001011100… |
… | …0101001111010000101 |
3 | 110202111010002111211112 |
4 | 1330102320221322011 |
5 | 4141311432442111 |
6 | 141151104414405 |
7 | 12433166214161 |
oct | 1742270517205 |
9 | 422433074745 |
10 | 133460827781 |
11 | 51667181286 |
12 | 21a47917405 |
13 | c77bba7318 |
14 | 6660d8bca1 |
15 | 3711ad3e8b |
hex | 1f12e29e85 |
133460827781 has 8 divisors (see below), whose sum is σ = 136720785600. Its totient is φ = 130201099360.
The previous prime is 133460827777. The next prime is 133460827813. The reversal of 133460827781 is 187728064331.
It is a happy number.
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 133460827781 - 22 = 133460827777 is a prime.
It is a super-2 number, since 2×1334608277812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133460847781) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2089010 + ... + 2151948.
It is an arithmetic number, because the mean of its divisors is an integer number (17090098200).
Almost surely, 2133460827781 is an apocalyptic number.
It is an amenable number.
133460827781 is a deficient number, since it is larger than the sum of its proper divisors (3259957819).
133460827781 is an equidigital number, since it uses as much as digits as its factorization.
133460827781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114699.
The product of its (nonzero) digits is 1354752, while the sum is 50.
The spelling of 133460827781 in words is "one hundred thirty-three billion, four hundred sixty million, eight hundred twenty-seven thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •