Base | Representation |
---|---|
bin | 110111111110001111… |
… | …0100111001011001001 |
3 | 102111020221111200012022 |
4 | 1233330132213023021 |
5 | 3432132200001301 |
6 | 131115155054225 |
7 | 11453445100241 |
oct | 1577436471311 |
9 | 374227450168 |
10 | 120200000201 |
11 | 46a81848246 |
12 | 1b3668a1375 |
13 | b447771798 |
14 | 5b63b28b21 |
15 | 31d780ed1b |
hex | 1bfc7a72c9 |
120200000201 has 8 divisors (see below), whose sum is σ = 122365611360. Its totient is φ = 118038666592.
The previous prime is 120200000183. The next prime is 120200000203. The reversal of 120200000201 is 102000002021.
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 120200000201 - 234 = 103020131017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120200000203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1012655 + ... + 1125108.
It is an arithmetic number, because the mean of its divisors is an integer number (15295701420).
Almost surely, 2120200000201 is an apocalyptic number.
It is an amenable number.
120200000201 is a deficient number, since it is larger than the sum of its proper divisors (2165611159).
120200000201 is an equidigital number, since it uses as much as digits as its factorization.
120200000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2138775.
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 120200000201 its reverse (102000002021), we get a palindrome (222200002222).
It can be divided in two parts, 1 and 20200000201, that added together give a palindrome (20200000202).
The spelling of 120200000201 in words is "one hundred twenty billion, two hundred million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •