Base | Representation |
---|---|
bin | 111110000101100010… |
… | …1100111111110110001 |
3 | 110202010222221021121202 |
4 | 1330023011213332301 |
5 | 4141024440310113 |
6 | 141130112500545 |
7 | 12430020246263 |
oct | 1741305477661 |
9 | 422128837552 |
10 | 133330010033 |
11 | 515aa350a40 |
12 | 21a0bb4a755 |
13 | c75aa6357c |
14 | 664b857b33 |
15 | 3705393258 |
hex | 1f0b167fb1 |
133330010033 has 8 divisors (see below), whose sum is σ = 145769198880. Its totient is φ = 120943867680.
The previous prime is 133330010017. The next prime is 133330010041. The reversal of 133330010033 is 330010033331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133330010033 - 24 = 133330010017 is a prime.
It is a super-2 number, since 2×1333300100332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133330009987 and 133330010014.
It is not an unprimeable number, because it can be changed into a prime (133330010003) 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, 13256363 + ... + 13266416.
It is an arithmetic number, because the mean of its divisors is an integer number (18221149860).
Almost surely, 2133330010033 is an apocalyptic number.
It is an amenable number.
133330010033 is a deficient number, since it is larger than the sum of its proper divisors (12439188847).
133330010033 is a wasteful number, since it uses less digits than its factorization.
133330010033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26523247.
The product of its (nonzero) digits is 729, while the sum is 20.
Adding to 133330010033 its reverse (330010033331), we get a palindrome (463340043364).
The spelling of 133330010033 in words is "one hundred thirty-three billion, three hundred thirty million, ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •