Base | Representation |
---|---|
bin | 11011010100001000000100… |
… | …000010011111111100101101 |
3 | 120202100100022100220221212122 |
4 | 123110020010002133330231 |
5 | 111221203330034030013 |
6 | 1103255033243042325 |
7 | 34206061616533061 |
oct | 3324100402377455 |
9 | 522310270827778 |
10 | 120130303033133 |
11 | 35305a802a9648 |
12 | 115820835103a5 |
13 | 5205315021a43 |
14 | 21944a289baa1 |
15 | dd4ce8dc6a08 |
hex | 6d420409ff2d |
120130303033133 has 8 divisors (see below), whose sum is σ = 120360544704000. Its totient is φ = 119900063451168.
The previous prime is 120130303033031. The next prime is 120130303033157. The reversal of 120130303033133 is 331330303031021.
It is a happy number.
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 120130303033133 - 222 = 120130298838829 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 (120130303033193) 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, 164484713 + ... + 165213441.
It is an arithmetic number, because the mean of its divisors is an integer number (15045068088000).
Almost surely, 2120130303033133 is an apocalyptic number.
It is an amenable number.
120130303033133 is a deficient number, since it is larger than the sum of its proper divisors (230241670867).
120130303033133 is an equidigital number, since it uses as much as digits as its factorization.
120130303033133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1044451.
The product of its (nonzero) digits is 4374, while the sum is 26.
Adding to 120130303033133 its reverse (331330303031021), we get a palindrome (451460606064154).
The spelling of 120130303033133 in words is "one hundred twenty trillion, one hundred thirty billion, three hundred three million, thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •