Base | Representation |
---|---|
bin | 11110010110001100101001… |
… | …010010000100111110000001 |
3 | 122111120022010212100000000001 |
4 | 132112030221102010332001 |
5 | 114443210002114444001 |
6 | 1151505445130000001 |
7 | 40053441520610101 |
oct | 3626145122047601 |
9 | 574508125300001 |
10 | 133466801328001 |
11 | 39587a52971799 |
12 | 12b76915876001 |
13 | 5961b3327582b |
14 | 24d5b8310d201 |
15 | 1066ba00ac001 |
hex | 796329484f81 |
133466801328001 has 4 divisors (see below), whose sum is σ = 138069104822100. Its totient is φ = 128864497833904.
The previous prime is 133466801327983. The next prime is 133466801328013. The reversal of 133466801328001 is 100823108664331.
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 24828893779600 + 108637907548401 = 4982860^2 + 10422951^2 .
It is a cyclic number.
It is not a de Polignac number, because 133466801328001 - 241 = 131267778072449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133466801320001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2301151747006 + ... + 2301151747063.
It is an arithmetic number, because the mean of its divisors is an integer number (34517276205525).
Almost surely, 2133466801328001 is an apocalyptic number.
It is an amenable number.
133466801328001 is a deficient number, since it is larger than the sum of its proper divisors (4602303494099).
133466801328001 is an equidigital number, since it uses as much as digits as its factorization.
133466801328001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4602303494098.
The product of its (nonzero) digits is 497664, while the sum is 46.
The spelling of 133466801328001 in words is "one hundred thirty-three trillion, four hundred sixty-six billion, eight hundred one million, three hundred twenty-eight thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •