Base | Representation |
---|---|
bin | 111101111100000010… |
… | …1000111100001111101 |
3 | 110201022202212111000220 |
4 | 1323320011013201331 |
5 | 4134401321010023 |
6 | 141034321411553 |
7 | 12416065531515 |
oct | 1737005074175 |
9 | 421282774026 |
10 | 133011110013 |
11 | 51456338701 |
12 | 21941199bb9 |
13 | c709978c32 |
14 | 661b364845 |
15 | 36d739e3e3 |
hex | 1ef814787d |
133011110013 has 8 divisors (see below), whose sum is σ = 177355920768. Its totient is φ = 88670186304.
The previous prime is 133011110009. The next prime is 133011110027. The reversal of 133011110013 is 310011110331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 133011110013 - 22 = 133011110009 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 133011109974 and 133011110001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133011110053) 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, 890956 + ... + 1029477.
It is an arithmetic number, because the mean of its divisors is an integer number (22169490096).
Almost surely, 2133011110013 is an apocalyptic number.
It is an amenable number.
133011110013 is a deficient number, since it is larger than the sum of its proper divisors (44344810755).
133011110013 is a wasteful number, since it uses less digits than its factorization.
133011110013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1943523.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 133011110013 its reverse (310011110331), we get a palindrome (443022220344).
The spelling of 133011110013 in words is "one hundred thirty-three billion, eleven million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •