Base | Representation |
---|---|
bin | 100001100101011… |
… | …0010100101100000 |
3 | 2220112110120002021 |
4 | 1003022302211200 |
5 | 4301441331422 |
6 | 303453231224 |
7 | 36632336620 |
oct | 10312624540 |
9 | 2815416067 |
10 | 1126902112 |
11 | 52911a266 |
12 | 275492514 |
13 | 14c60c8ab |
14 | a9942880 |
15 | 68debdc7 |
hex | 432b2960 |
1126902112 has 96 divisors (see below), whose sum is σ = 2696343552. Its totient is φ = 453133824.
The previous prime is 1126902109. The next prime is 1126902113. The reversal of 1126902112 is 2112096211.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1126902113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 270993 + ... + 275119.
It is an arithmetic number, because the mean of its divisors is an integer number (28086912).
Almost surely, 21126902112 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 1126902112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1348171776).
1126902112 is an abundant number, since it is smaller than the sum of its proper divisors (1569441440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1126902112 is a wasteful number, since it uses less digits than its factorization.
1126902112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4220 (or 4212 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 25.
The square root of 1126902112 is about 33569.3626987466. The cubic root of 1126902112 is about 1040.6277373963.
Adding to 1126902112 its reverse (2112096211), we get a palindrome (3238998323).
The spelling of 1126902112 in words is "one billion, one hundred twenty-six million, nine hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •