Base | Representation |
---|---|
bin | 111000001100000001… |
… | …1100010011110101101 |
3 | 102112110012002111011112 |
4 | 1300120003202132231 |
5 | 3434104120241013 |
6 | 131233123401405 |
7 | 11501063505503 |
oct | 1603003423655 |
9 | 375405074145 |
10 | 120662665133 |
11 | 47199a2425a |
12 | 1b475823265 |
13 | b4bc58400a |
14 | 5ba9362673 |
15 | 3213250ba8 |
hex | 1c180e27ad |
120662665133 has 4 divisors (see below), whose sum is σ = 122315578428. Its totient is φ = 119009751840.
The previous prime is 120662665129. The next prime is 120662665141. The reversal of 120662665133 is 331566266021.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 72131456329 + 48531208804 = 268573^2 + 220298^2 .
It is a cyclic number.
It is not a de Polignac number, because 120662665133 - 22 = 120662665129 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 (120662665933) 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 3 ways as a sum of consecutive naturals, for example, 826456538 + ... + 826456683.
It is an arithmetic number, because the mean of its divisors is an integer number (30578894607).
Almost surely, 2120662665133 is an apocalyptic number.
It is an amenable number.
120662665133 is a deficient number, since it is larger than the sum of its proper divisors (1652913295).
120662665133 is an equidigital number, since it uses as much as digits as its factorization.
120662665133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1652913294.
The product of its (nonzero) digits is 233280, while the sum is 41.
The spelling of 120662665133 in words is "one hundred twenty billion, six hundred sixty-two million, six hundred sixty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •