Base | Representation |
---|---|
bin | 110111111000111000… |
… | …0101111001010010101 |
3 | 102110210102011222121121 |
4 | 1233301300233022111 |
5 | 3431300132432013 |
6 | 131045253243541 |
7 | 11446132612516 |
oct | 1576160571225 |
9 | 373712158547 |
10 | 120020202133 |
11 | 4699a3032a7 |
12 | 1b3166335b1 |
13 | b41943b7b0 |
14 | 5b47cc4a0d |
15 | 31c6b4658d |
hex | 1bf1c2f295 |
120020202133 has 24 divisors (see below), whose sum is σ = 132024702600. Its totient is φ = 108447820800.
The previous prime is 120020202131. The next prime is 120020202151. The reversal of 120020202133 is 331202020021.
It can be written as a sum of positive squares in 12 ways, for example, as 1093161969 + 118927040164 = 33063^2 + 344858^2 .
It is not a de Polignac number, because 120020202133 - 21 = 120020202131 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120020202131) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11797473 + ... + 11807641.
It is an arithmetic number, because the mean of its divisors is an integer number (5501029275).
Almost surely, 2120020202133 is an apocalyptic number.
120020202133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
120020202133 is a deficient number, since it is larger than the sum of its proper divisors (12004500467).
120020202133 is a wasteful number, since it uses less digits than its factorization.
120020202133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10473 (or 10372 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 120020202133 its reverse (331202020021), we get a palindrome (451222222154).
The spelling of 120020202133 in words is "one hundred twenty billion, twenty million, two hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •