Base | Representation |
---|---|
bin | 100001011010010… |
… | …0000101000111000 |
3 | 2220010110211011210 |
4 | 1002310200220320 |
5 | 4243442431212 |
6 | 303124123120 |
7 | 36531602451 |
oct | 10264405070 |
9 | 2803424153 |
10 | 1121061432 |
11 | 5258a0057 |
12 | 2735364a0 |
13 | 14b34627a |
14 | a8c62128 |
15 | 6864653c |
hex | 42d20a38 |
1121061432 has 32 divisors (see below), whose sum is σ = 2893063680. Its totient is φ = 361632480.
The previous prime is 1121061421. The next prime is 1121061457. The reversal of 1121061432 is 2341601211.
It is a junction number, because it is equal to n+sod(n) for n = 1121061399 and 1121061408.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 752658 + ... + 754145.
It is an arithmetic number, because the mean of its divisors is an integer number (90408240).
Almost surely, 21121061432 is an apocalyptic number.
1121061432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1121061432 is an abundant number, since it is smaller than the sum of its proper divisors (1772002248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121061432 is a wasteful number, since it uses less digits than its factorization.
1121061432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1506843 (or 1506839 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
The square root of 1121061432 is about 33482.2554795820. The cubic root of 1121061432 is about 1038.8267810384.
Adding to 1121061432 its reverse (2341601211), we get a palindrome (3462662643).
The spelling of 1121061432 in words is "one billion, one hundred twenty-one million, sixty-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •