Base | Representation |
---|---|
bin | 111000001011011101… |
… | …0000100100100110101 |
3 | 102112101211212000210020 |
4 | 1300112322010210311 |
5 | 3434034202444013 |
6 | 131231154515353 |
7 | 11500441014015 |
oct | 1602672044465 |
9 | 375354760706 |
10 | 120643406133 |
11 | 4718a06a728 |
12 | 1b46b295b59 |
13 | b4b859cc63 |
14 | 5ba698bc45 |
15 | 32116e9623 |
hex | 1c16e84935 |
120643406133 has 8 divisors (see below), whose sum is σ = 170320102848. Its totient is φ = 75697823424.
The previous prime is 120643406057. The next prime is 120643406161. The reversal of 120643406133 is 331604346021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120643406133 - 226 = 120576297269 is a prime.
It is a super-3 number, since 3×1206434061333 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120643406094 and 120643406103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120643402133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1182778441 + ... + 1182778542.
It is an arithmetic number, because the mean of its divisors is an integer number (21290012856).
Almost surely, 2120643406133 is an apocalyptic number.
It is an amenable number.
120643406133 is a deficient number, since it is larger than the sum of its proper divisors (49676696715).
120643406133 is a wasteful number, since it uses less digits than its factorization.
120643406133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2365557003.
The product of its (nonzero) digits is 31104, while the sum is 33.
The spelling of 120643406133 in words is "one hundred twenty billion, six hundred forty-three million, four hundred six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •