Base | Representation |
---|---|
bin | 111011101010101… |
… | …101000000000000 |
3 | 2120202122121121002 |
4 | 323222231000000 |
5 | 4022232100422 |
6 | 243155551132 |
7 | 33543533306 |
oct | 7352550000 |
9 | 2522577532 |
10 | 1001050112 |
11 | 474080847 |
12 | 23b2bb4a8 |
13 | 12c51715a |
14 | 96d42276 |
15 | 5cd3c692 |
hex | 3baad000 |
1001050112 has 78 divisors (see below), whose sum is σ = 2115882738. Its totient is φ = 473481216.
The previous prime is 1001050103. The next prime is 1001050123. The reversal of 1001050112 is 2110501001.
It can be written as a sum of positive squares in only one way, i.e., 999571456 + 1478656 = 31616^2 + 1216^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1001050093 and 1001050102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1478318 + ... + 1478994.
Almost surely, 21001050112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1001050112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1057941369).
1001050112 is an abundant number, since it is smaller than the sum of its proper divisors (1114832626).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001050112 is an frugal number, since it uses more digits than its factorization.
1001050112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 739 (or 698 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 11.
The square root of 1001050112 is about 31639.3759736187. The cubic root of 1001050112 is about 1000.3499148786.
Adding to 1001050112 its reverse (2110501001), we get a palindrome (3111551113).
The spelling of 1001050112 in words is "one billion, one million, fifty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •