Base | Representation |
---|---|
bin | 1000001001111011… |
… | …1010010000000000 |
3 | 12122120020212220000 |
4 | 2002132322100000 |
5 | 13440410002432 |
6 | 1001120520000 |
7 | 105151251153 |
oct | 20236722000 |
9 | 5576225800 |
10 | 2189140992 |
11 | a23793035 |
12 | 511180000 |
13 | 28b6cbacc |
14 | 16aa51c9a |
15 | cc2c457c |
hex | 827ba400 |
2189140992 has 110 divisors (see below), whose sum is σ = 6537450678. Its totient is φ = 729686016.
The previous prime is 2189140979. The next prime is 2189140999. The reversal of 2189140992 is 2990419812.
It can be written as a sum of positive squares in only one way, i.e., 1816805376 + 372335616 = 42624^2 + 19296^2 .
It is not an unprimeable number, because it can be changed into a prime (2189140999) by changing a digit.
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 9 ways as a sum of consecutive naturals, for example, 69748 + ... + 96140.
Almost surely, 22189140992 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 2189140992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3268725339).
2189140992 is an abundant number, since it is smaller than the sum of its proper divisors (4348309686).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2189140992 is an equidigital number, since it uses as much as digits as its factorization.
2189140992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26425 (or 26398 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 45.
The square root of 2189140992 is about 46788.2569882658. The cubic root of 2189140992 is about 1298.4480478049.
The spelling of 2189140992 in words is "two billion, one hundred eighty-nine million, one hundred forty thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •