Base | Representation |
---|---|
bin | 11110100100000010101… |
… | …11011110101111001101 |
3 | 10201101121020021002222110 |
4 | 33102001113132233031 |
5 | 114201142430430201 |
6 | 2122232340534233 |
7 | 135604336266660 |
oct | 17220127365715 |
9 | 3641536232873 |
10 | 1050142436301 |
11 | 3753aa0344a2 |
12 | 14b6366b1379 |
13 | 780496b97aa |
14 | 38b81a536d7 |
15 | 1c4b38946d6 |
hex | f4815debcd |
1050142436301 has 32 divisors (see below), whose sum is σ = 1602653257728. Its totient is φ = 599168338560.
The previous prime is 1050142436227. The next prime is 1050142436311. The reversal of 1050142436301 is 1036342410501.
It is not a de Polignac number, because 1050142436301 - 27 = 1050142436173 is a prime.
It is a super-2 number, since 2×10501424363012 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1050142436311) 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 31 ways as a sum of consecutive naturals, for example, 59017716 + ... + 59035506.
It is an arithmetic number, because the mean of its divisors is an integer number (50082914304).
Almost surely, 21050142436301 is an apocalyptic number.
It is an amenable number.
1050142436301 is a deficient number, since it is larger than the sum of its proper divisors (552510821427).
1050142436301 is a wasteful number, since it uses less digits than its factorization.
1050142436301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21921.
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 1050142436301 its reverse (1036342410501), we get a palindrome (2086484846802).
The spelling of 1050142436301 in words is "one trillion, fifty billion, one hundred forty-two million, four hundred thirty-six thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •