Base | Representation |
---|---|
bin | 1011101101101011110… |
… | …1101111100001010100 |
3 | 201020102220112121202112 |
4 | 2323122331233201110 |
5 | 11244120440123012 |
6 | 232241020530152 |
7 | 20352652514003 |
oct | 2733275574124 |
9 | 636386477675 |
10 | 201242114132 |
11 | 78389a21a04 |
12 | 330036b0958 |
13 | 15c9176a557 |
14 | 9a51054c3a |
15 | 537c52d122 |
hex | 2edaf6f854 |
201242114132 has 6 divisors (see below), whose sum is σ = 352173699738. Its totient is φ = 100621057064.
The previous prime is 201242114119. The next prime is 201242114141. The reversal of 201242114132 is 231411242102.
It can be written as a sum of positive squares in only one way, i.e., 199571266756 + 1670847376 = 446734^2 + 40876^2 .
It is a super-2 number, since 2×2012421141322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201242114098 and 201242114107.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 25155264263 + ... + 25155264270.
It is an arithmetic number, because the mean of its divisors is an integer number (58695616623).
Almost surely, 2201242114132 is an apocalyptic number.
It is an amenable number.
201242114132 is a deficient number, since it is larger than the sum of its proper divisors (150931585606).
201242114132 is a wasteful number, since it uses less digits than its factorization.
201242114132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50310528537 (or 50310528535 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 201242114132 its reverse (231411242102), we get a palindrome (432653356234).
The spelling of 201242114132 in words is "two hundred one billion, two hundred forty-two million, one hundred fourteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •