Base | Representation |
---|---|
bin | 100000011101111… |
… | …1110010100001100 |
3 | 2210221000111001101 |
4 | 1000323332110030 |
5 | 4212400313224 |
6 | 300034552444 |
7 | 35666200420 |
oct | 10073762414 |
9 | 2727014041 |
10 | 1089463564 |
11 | 509a79112 |
12 | 264a38724 |
13 | 144931bc7 |
14 | a4998b80 |
15 | 659a4044 |
hex | 40efe50c |
1089463564 has 48 divisors (see below), whose sum is σ = 2322734400. Its totient is φ = 436469760.
The previous prime is 1089463559. The next prime is 1089463567. The reversal of 1089463564 is 4653649801.
It is not an unprimeable number, because it can be changed into a prime (1089463567) 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, 63244 + ... + 78604.
It is an arithmetic number, because the mean of its divisors is an integer number (48390300).
Almost surely, 21089463564 is an apocalyptic number.
1089463564 is a gapful number since it is divisible by the number (14) 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 1089463564, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1161367200).
1089463564 is an abundant number, since it is smaller than the sum of its proper divisors (1233270836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1089463564 is a wasteful number, since it uses less digits than its factorization.
1089463564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15538 (or 15536 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 46.
The square root of 1089463564 is about 33007.0229496694. The cubic root of 1089463564 is about 1028.9736104068.
The spelling of 1089463564 in words is "one billion, eighty-nine million, four hundred sixty-three thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •