Base | Representation |
---|---|
bin | 11110100100000011101… |
… | …00011000000011100111 |
3 | 10201101121202111221122222 |
4 | 33102001310120003213 |
5 | 114201201400323421 |
6 | 2122233211142555 |
7 | 135604460545655 |
oct | 17220164300347 |
9 | 3641552457588 |
10 | 1050150011111 |
11 | 375403338573 |
12 | 14b639144a5b |
13 | 7804b13c526 |
14 | 38b82a65dd5 |
15 | 1c4b438dcab |
hex | f481d180e7 |
1050150011111 has 4 divisors (see below), whose sum is σ = 1050155707152. Its totient is φ = 1050144315072.
The previous prime is 1050150011087. The next prime is 1050150011137. The reversal of 1050150011111 is 1111100510501.
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 1050150011111 - 234 = 1032970141927 is a prime.
It is a super-2 number, since 2×10501500111112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1050150011111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1050150011711) 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, 2561891 + ... + 2943396.
It is an arithmetic number, because the mean of its divisors is an integer number (262538926788).
Almost surely, 21050150011111 is an apocalyptic number.
1050150011111 is a deficient number, since it is larger than the sum of its proper divisors (5696041).
1050150011111 is an equidigital number, since it uses as much as digits as its factorization.
1050150011111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5696040.
The product of its (nonzero) digits is 25, while the sum is 17.
Adding to 1050150011111 its reverse (1111100510501), we get a palindrome (2161250521612).
The spelling of 1050150011111 in words is "one trillion, fifty billion, one hundred fifty million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •