Base | Representation |
---|---|
bin | 11110100100001101011… |
… | …01100001100100001011 |
3 | 10201101211110222120000002 |
4 | 33102012231201210023 |
5 | 114201333404214011 |
6 | 2122245302433215 |
7 | 135606505365323 |
oct | 17220655414413 |
9 | 3641743876002 |
10 | 1050232101131 |
11 | 375445706a64 |
12 | 14b66073280b |
13 | 78062151cc5 |
14 | 38b8d914283 |
15 | 1c4bb6a6c3b |
hex | f486b6190b |
1050232101131 has 8 divisors (see below), whose sum is σ = 1088136673680. Its totient is φ = 1012440173472.
The previous prime is 1050232101101. The next prime is 1050232101157. The reversal of 1050232101131 is 1311012320501.
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 1050232101131 - 214 = 1050232084747 is a prime.
It is a super-2 number, since 2×10502321011312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1050232101101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28142240 + ... + 28179533.
It is an arithmetic number, because the mean of its divisors is an integer number (136017084210).
Almost surely, 21050232101131 is an apocalyptic number.
1050232101131 is a deficient number, since it is larger than the sum of its proper divisors (37904572549).
1050232101131 is an equidigital number, since it uses as much as digits as its factorization.
1050232101131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56322445.
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 1050232101131 its reverse (1311012320501), we get a palindrome (2361244421632).
The spelling of 1050232101131 in words is "one trillion, fifty billion, two hundred thirty-two million, one hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •