Base | Representation |
---|---|
bin | 11110010110000110010110… |
… | …100100110100000110100101 |
3 | 122111112122201000011001222211 |
4 | 132112012112210310012211 |
5 | 114443102133011142410 |
6 | 1151502410454523421 |
7 | 40053112221135601 |
oct | 3626062644640645 |
9 | 574478630131884 |
10 | 133460045021605 |
11 | 395850a61337a5 |
12 | 12b7554b066571 |
13 | 59612c75b49b3 |
14 | 24d5701aaa501 |
15 | 1066906d7d68a |
hex | 7961969341a5 |
133460045021605 has 8 divisors (see below), whose sum is σ = 161226900027000. Its totient is φ = 106051472016576.
The previous prime is 133460045021581. The next prime is 133460045021729. The reversal of 133460045021605 is 506120540064331.
It can be written as a sum of positive squares in 4 ways, for example, as 3043622181604 + 130416422840001 = 1744598^2 + 11420001^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133460045021605 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, 89570499270 + ... + 89570500759.
It is an arithmetic number, because the mean of its divisors is an integer number (20153362503375).
Almost surely, 2133460045021605 is an apocalyptic number.
It is an amenable number.
133460045021605 is a deficient number, since it is larger than the sum of its proper divisors (27766855005395).
133460045021605 is a wasteful number, since it uses less digits than its factorization.
133460045021605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 179141000183.
The product of its (nonzero) digits is 259200, while the sum is 40.
Adding to 133460045021605 its reverse (506120540064331), we get a palindrome (639580585085936).
The spelling of 133460045021605 in words is "one hundred thirty-three trillion, four hundred sixty billion, forty-five million, twenty-one thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •