Base | Representation |
---|---|
bin | 11110100011111110010… |
… | …11000000001101011101 |
3 | 10201101111122222012022011 |
4 | 33101333023000031131 |
5 | 114201104014023401 |
6 | 2122224543351221 |
7 | 135603411263611 |
oct | 17217713001535 |
9 | 3641448865264 |
10 | 1050105611101 |
11 | 375390272148 |
12 | 14b6262b2511 |
13 | 78041b95031 |
14 | 38b7abc9341 |
15 | 1c4b051d451 |
hex | f47f2c035d |
1050105611101 has 4 divisors (see below), whose sum is σ = 1069918924572. Its totient is φ = 1030292297632.
The previous prime is 1050105611029. The next prime is 1050105611111. The reversal of 1050105611101 is 1011165010501.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 587568240900 + 462537370201 = 766530^2 + 680101^2 .
It is a cyclic number.
It is not a de Polignac number, because 1050105611101 - 229 = 1049568740189 is a prime.
It is a super-2 number, since 2×10501056111012 (a number of 25 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 (1050105611111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9906656656 + ... + 9906656761.
It is an arithmetic number, because the mean of its divisors is an integer number (267479731143).
Almost surely, 21050105611101 is an apocalyptic number.
It is an amenable number.
1050105611101 is a deficient number, since it is larger than the sum of its proper divisors (19813313471).
1050105611101 is an equidigital number, since it uses as much as digits as its factorization.
1050105611101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19813313470.
The product of its (nonzero) digits is 150, while the sum is 22.
The spelling of 1050105611101 in words is "one trillion, fifty billion, one hundred five million, six hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •