Base | Representation |
---|---|
bin | 100000011101110… |
… | …1101000000010000 |
3 | 2210220212212210011 |
4 | 1000323231000100 |
5 | 4212341031111 |
6 | 300033244304 |
7 | 35665453612 |
oct | 10073550020 |
9 | 2726785704 |
10 | 1089392656 |
11 | 509a2a910 |
12 | 264a03694 |
13 | 144908851 |
14 | a497adb2 |
15 | 6598d021 |
hex | 40eed010 |
1089392656 has 80 divisors (see below), whose sum is σ = 2421720000. Its totient is φ = 470131200.
The previous prime is 1089392593. The next prime is 1089392693. The reversal of 1089392656 is 6562939801.
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 15 ways as a sum of consecutive naturals, for example, 309595 + ... + 313093.
It is an arithmetic number, because the mean of its divisors is an integer number (30271500).
Almost surely, 21089392656 is an apocalyptic number.
1089392656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1089392656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1210860000).
1089392656 is an abundant number, since it is smaller than the sum of its proper divisors (1332327344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1089392656 is a wasteful number, since it uses less digits than its factorization.
1089392656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3608 (or 3602 counting only the distinct ones).
The product of its (nonzero) digits is 699840, while the sum is 49.
The square root of 1089392656 is about 33005.9487971487. The cubic root of 1089392656 is about 1028.9512862569.
The spelling of 1089392656 in words is "one billion, eighty-nine million, three hundred ninety-two thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •