Base | Representation |
---|---|
bin | 111101111011101110… |
… | …0000001001111101110 |
3 | 110201022000121010100221 |
4 | 1323313130001033232 |
5 | 4134341041230431 |
6 | 141033254441554 |
7 | 12415605130462 |
oct | 1736734011756 |
9 | 421260533327 |
10 | 133000336366 |
11 | 5145024a267 |
12 | 219396632ba |
13 | c7076761b1 |
14 | 6619b5c4a2 |
15 | 36d6472111 |
hex | 1ef77013ee |
133000336366 has 8 divisors (see below), whose sum is σ = 211235828400. Its totient is φ = 62588393568.
The previous prime is 133000336327. The next prime is 133000336369. The reversal of 133000336366 is 663633000331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (34), and also a Moran number because the ratio is a prime number: 3911774599 = 133000336366 / (1 + 3 + 3 + 0 + 0 + 0 + 3 + 3 + 6 + 3 + 6 + 6).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133000336369) 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 3 ways as a sum of consecutive naturals, for example, 1955887266 + ... + 1955887333.
It is an arithmetic number, because the mean of its divisors is an integer number (26404478550).
Almost surely, 2133000336366 is an apocalyptic number.
133000336366 is a deficient number, since it is larger than the sum of its proper divisors (78235492034).
133000336366 is a wasteful number, since it uses less digits than its factorization.
133000336366 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3911774618.
The product of its (nonzero) digits is 52488, while the sum is 34.
Adding to 133000336366 its reverse (663633000331), we get a palindrome (796633336697).
The spelling of 133000336366 in words is "one hundred thirty-three billion, three hundred thirty-six thousand, three hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •