Base | Representation |
---|---|
bin | 11110001111101101100000… |
… | …000001000111011111110001 |
3 | 122102222200120012110020122110 |
4 | 132033231200001013133301 |
5 | 114413404044003430001 |
6 | 1150525005030355533 |
7 | 40006311310601340 |
oct | 3617554001073761 |
9 | 572880505406573 |
10 | 133021043030001 |
11 | 394259a8a36895 |
12 | 12b044521bbba9 |
13 | 592baa48b4919 |
14 | 24bc377ac9b57 |
15 | 105a2b13d93d6 |
hex | 78fb600477f1 |
133021043030001 has 16 divisors (see below), whose sum is σ = 202855741365248. Its totient is φ = 75953146165200.
The previous prime is 133021043029997. The next prime is 133021043030009. The reversal of 133021043030001 is 100030340120331.
It is not a de Polignac number, because 133021043030001 - 22 = 133021043029997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 133021043030001.
It is not an unprimeable number, because it can be changed into a prime (133021043030009) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2453239885 + ... + 2453294106.
It is an arithmetic number, because the mean of its divisors is an integer number (12678483835328).
Almost surely, 2133021043030001 is an apocalyptic number.
It is an amenable number.
133021043030001 is a deficient number, since it is larger than the sum of its proper divisors (69834698335247).
133021043030001 is a wasteful number, since it uses less digits than its factorization.
133021043030001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4906535292.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 133021043030001 its reverse (100030340120331), we get a palindrome (233051383150332).
The spelling of 133021043030001 in words is "one hundred thirty-three trillion, twenty-one billion, forty-three million, thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •