Base | Representation |
---|---|
bin | 100001100011110… |
… | …0011011100000000 |
3 | 2220110212110012002 |
4 | 1003013203130000 |
5 | 4301232204012 |
6 | 303423123132 |
7 | 36622204124 |
oct | 10307433400 |
9 | 2813773162 |
10 | 1126053632 |
11 | 52869a840 |
12 | 2751434a8 |
13 | 14c3a3632 |
14 | a97a1584 |
15 | 68cd07c2 |
hex | 431e3700 |
1126053632 has 72 divisors (see below), whose sum is σ = 2480148720. Its totient is φ = 505978880.
The previous prime is 1126053629. The next prime is 1126053647. The reversal of 1126053632 is 2363506211.
It is a junction number, because it is equal to n+sod(n) for n = 1126053595 and 1126053604.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 248378 + ... + 252870.
It is an arithmetic number, because the mean of its divisors is an integer number (34446510).
Almost surely, 21126053632 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 1126053632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1240074360).
1126053632 is an abundant number, since it is smaller than the sum of its proper divisors (1354095088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1126053632 is an equidigital number, since it uses as much as digits as its factorization.
1126053632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4609 (or 4595 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 29.
The square root of 1126053632 is about 33556.7226051651. The cubic root of 1126053632 is about 1040.3664980491.
Adding to 1126053632 its reverse (2363506211), we get a palindrome (3489559843).
The spelling of 1126053632 in words is "one billion, one hundred twenty-six million, fifty-three thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •