Base | Representation |
---|---|
bin | 11110001111101110011001… |
… | …010011011011110010001001 |
3 | 122102222210001011221100002212 |
4 | 132033232121103123302021 |
5 | 114413413031024224001 |
6 | 1150525244242234505 |
7 | 40006344161050034 |
oct | 3617563123336211 |
9 | 572883034840085 |
10 | 133022004133001 |
11 | 39426351502795 |
12 | 12b04680055a35 |
13 | 592bbc8a53319 |
14 | 24bc4295d001b |
15 | 105a31a9857bb |
hex | 78fb994dbc89 |
133022004133001 has 8 divisors (see below), whose sum is σ = 138819325155264. Its totient is φ = 127225829412880.
The previous prime is 133022004132961. The next prime is 133022004133019. The reversal of 133022004133001 is 100331400220331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 133022004133001 - 26 = 133022004132937 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133022004133901) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 286338386 + ... + 286802571.
It is an arithmetic number, because the mean of its divisors is an integer number (17352415644408).
Almost surely, 2133022004133001 is an apocalyptic number.
It is an amenable number.
133022004133001 is a deficient number, since it is larger than the sum of its proper divisors (5797321022263).
133022004133001 is a wasteful number, since it uses less digits than its factorization.
133022004133001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 573151071.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 133022004133001 its reverse (100331400220331), we get a palindrome (233353404353332).
The spelling of 133022004133001 in words is "one hundred thirty-three trillion, twenty-two billion, four million, one hundred thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •