Base | Representation |
---|---|
bin | 11110010010010110000111… |
… | …111010100010100101011101 |
3 | 122110121222220110000011201201 |
4 | 132102112013322202211131 |
5 | 114424340400330133041 |
6 | 1151144111143435501 |
7 | 40025351144251354 |
oct | 3622260772424535 |
9 | 573558813004651 |
10 | 133202101021021 |
11 | 3949576a50030a |
12 | 12b33562155b91 |
13 | 5942b9a78ba56 |
14 | 24c703220a99b |
15 | 105ed5b92b631 |
hex | 792587ea295d |
133202101021021 has 16 divisors (see below), whose sum is σ = 133556072209920. Its totient is φ = 132848518046400.
The previous prime is 133202101021007. The next prime is 133202101021039. The reversal of 133202101021021 is 120120101202331.
It is a cyclic number.
It is not a de Polignac number, because 133202101021021 - 27 = 133202101020893 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 133202101021021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133202101091021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8831266146 + ... + 8831281228.
It is an arithmetic number, because the mean of its divisors is an integer number (8347254513120).
Almost surely, 2133202101021021 is an apocalyptic number.
It is an amenable number.
133202101021021 is a deficient number, since it is larger than the sum of its proper divisors (353971188899).
133202101021021 is a wasteful number, since it uses less digits than its factorization.
133202101021021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26436.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 133202101021021 its reverse (120120101202331), we get a palindrome (253322202223352).
The spelling of 133202101021021 in words is "one hundred thirty-three trillion, two hundred two billion, one hundred one million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •