Base | Representation |
---|---|
bin | 111110000110001101… |
… | …1001101001011100011 |
3 | 110202012120011002010020 |
4 | 1330030123031023203 |
5 | 4141101211212033 |
6 | 141132233404523 |
7 | 12430412035305 |
oct | 1741433151343 |
9 | 422176132106 |
10 | 133352444643 |
11 | 51610a84440 |
12 | 21a17569743 |
13 | c7625b9ba2 |
14 | 6650817975 |
15 | 37073256b3 |
hex | 1f0c6cd2e3 |
133352444643 has 8 divisors (see below), whose sum is σ = 193967192256. Its totient is φ = 80819663400.
The previous prime is 133352444573. The next prime is 133352444647. The reversal of 133352444643 is 346444253331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 133352444643 - 29 = 133352444131 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 133352444595 and 133352444604.
It is not an unprimeable number, because it can be changed into a prime (133352444647) 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, 2020491553 + ... + 2020491618.
It is an arithmetic number, because the mean of its divisors is an integer number (24245899032).
Almost surely, 2133352444643 is an apocalyptic number.
133352444643 is a deficient number, since it is larger than the sum of its proper divisors (60614747613).
133352444643 is a wasteful number, since it uses less digits than its factorization.
133352444643 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4040983185.
The product of its digits is 1244160, while the sum is 42.
Adding to 133352444643 its reverse (346444253331), we get a palindrome (479796697974).
The spelling of 133352444643 in words is "one hundred thirty-three billion, three hundred fifty-two million, four hundred forty-four thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •