Base | Representation |
---|---|
bin | 111110001010111110… |
… | …0101000001101010001 |
3 | 110202121200202112200212 |
4 | 1330111330220031101 |
5 | 4141413110413131 |
6 | 141200141453505 |
7 | 12434361661352 |
oct | 1742574501521 |
9 | 422550675625 |
10 | 133512201041 |
11 | 5169317a81a |
12 | 21a60b71295 |
13 | c7897237bb |
14 | 6667b21d29 |
15 | 3716380a2b |
hex | 1f15f28351 |
133512201041 has 8 divisors (see below), whose sum is σ = 134210408640. Its totient is φ = 132815703888.
The previous prime is 133512201037. The next prime is 133512201047. The reversal of 133512201041 is 140102215331.
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 133512201041 - 22 = 133512201037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 133512200998 and 133512201016.
It is not an unprimeable number, because it can be changed into a prime (133512201047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 270941 + ... + 583466.
It is an arithmetic number, because the mean of its divisors is an integer number (16776301080).
Almost surely, 2133512201041 is an apocalyptic number.
It is an amenable number.
133512201041 is a deficient number, since it is larger than the sum of its proper divisors (698207599).
133512201041 is an equidigital number, since it uses as much as digits as its factorization.
133512201041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 855223.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 133512201041 its reverse (140102215331), we get a palindrome (273614416372).
The spelling of 133512201041 in words is "one hundred thirty-three billion, five hundred twelve million, two hundred one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •