Base | Representation |
---|---|
bin | 111101111011101101… |
… | …0110001111000100101 |
3 | 110201021222222121110111 |
4 | 1323313122301320211 |
5 | 4134341000330201 |
6 | 141033243453021 |
7 | 12415602304663 |
oct | 1736732617045 |
9 | 421258877414 |
10 | 133000011301 |
11 | 51450048013 |
12 | 21939527171 |
13 | c707591251 |
14 | 6619ab5c33 |
15 | 36d640ab51 |
hex | 1ef76b1e25 |
133000011301 has 8 divisors (see below), whose sum is σ = 139072366080. Its totient is φ = 126951802032.
The previous prime is 133000011283. The next prime is 133000011371. The reversal of 133000011301 is 103110000331.
It is a happy number.
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 133000011301 - 217 = 132999880229 is a prime.
It is a super-2 number, since 2×1330000113012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133000011371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6025110 + ... + 6047143.
It is an arithmetic number, because the mean of its divisors is an integer number (17384045760).
Almost surely, 2133000011301 is an apocalyptic number.
It is an amenable number.
133000011301 is a deficient number, since it is larger than the sum of its proper divisors (6072354779).
133000011301 is a wasteful number, since it uses less digits than its factorization.
133000011301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12072755.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 133000011301 its reverse (103110000331), we get a palindrome (236110011632).
The spelling of 133000011301 in words is "one hundred thirty-three billion, eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •