Base | Representation |
---|---|
bin | 111000001100001000… |
… | …0011101101100111001 |
3 | 102112110102110122001010 |
4 | 1300120100131230321 |
5 | 3434111002202213 |
6 | 131233324144133 |
7 | 11501134350102 |
oct | 1603020355471 |
9 | 375412418033 |
10 | 120666053433 |
11 | 471a0928a02 |
12 | 1b476998049 |
13 | b4c019c323 |
14 | 5ba99a53a9 |
15 | 32136beac3 |
hex | 1c1841db39 |
120666053433 has 8 divisors (see below), whose sum is σ = 164311221888. Its totient is φ = 78732460304.
The previous prime is 120666053413. The next prime is 120666053441. The reversal of 120666053433 is 334350666021.
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 120666053433 - 25 = 120666053401 is a prime.
It is a super-2 number, since 2×1206660534332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120666053391 and 120666053400.
It is not an unprimeable number, because it can be changed into a prime (120666053413) 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, 427893666 + ... + 427893947.
It is an arithmetic number, because the mean of its divisors is an integer number (20538902736).
Almost surely, 2120666053433 is an apocalyptic number.
It is an amenable number.
120666053433 is a deficient number, since it is larger than the sum of its proper divisors (43645168455).
120666053433 is an equidigital number, since it uses as much as digits as its factorization.
120666053433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 855787663.
The product of its (nonzero) digits is 233280, while the sum is 39.
The spelling of 120666053433 in words is "one hundred twenty billion, six hundred sixty-six million, fifty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •