Base | Representation |
---|---|
bin | 110111111110010001… |
… | …1010110011000011111 |
3 | 102111021000211202211011 |
4 | 1233330203112120133 |
5 | 3432133004222033 |
6 | 131115241440051 |
7 | 11453461462123 |
oct | 1577443263037 |
9 | 374230752734 |
10 | 120201242143 |
11 | 46a82516344 |
12 | 1b3671a0027 |
13 | b447ab7b68 |
14 | 5b63d6d583 |
15 | 31d79a7ccd |
hex | 1bfc8d661f |
120201242143 has 4 divisors (see below), whose sum is σ = 120346238440. Its totient is φ = 120056245848.
The previous prime is 120201242137. The next prime is 120201242159. The reversal of 120201242143 is 341242102021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 120201242143 - 29 = 120201241631 is a prime.
It is a super-2 number, since 2×1202012421432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120201242123) 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 3 ways as a sum of consecutive naturals, for example, 72496905 + ... + 72498562.
It is an arithmetic number, because the mean of its divisors is an integer number (30086559610).
Almost surely, 2120201242143 is an apocalyptic number.
120201242143 is a deficient number, since it is larger than the sum of its proper divisors (144996297).
120201242143 is an equidigital number, since it uses as much as digits as its factorization.
120201242143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144996296.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 120201242143 its reverse (341242102021), we get a palindrome (461443344164).
The spelling of 120201242143 in words is "one hundred twenty billion, two hundred one million, two hundred forty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •