Base | Representation |
---|---|
bin | 1001111010011101… |
… | …1101011101110000 |
3 | 20212110102010212220 |
4 | 2132213131131300 |
5 | 20422223110212 |
6 | 1120021321040 |
7 | 122642232402 |
oct | 23647353560 |
9 | 6773363786 |
10 | 2661144432 |
11 | 1146168221 |
12 | 623266180 |
13 | 335430a9b |
14 | 1b35dab72 |
15 | 10895c38c |
hex | 9e9dd770 |
2661144432 has 20 divisors (see below), whose sum is σ = 6874623240. Its totient is φ = 887048128.
The previous prime is 2661144407. The next prime is 2661144433. The reversal of 2661144432 is 2344411662.
It is a happy number.
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 2661144393 and 2661144402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2661144433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27720207 + ... + 27720302.
It is an arithmetic number, because the mean of its divisors is an integer number (343731162).
Almost surely, 22661144432 is an apocalyptic number.
It is an amenable number.
2661144432 is an abundant number, since it is smaller than the sum of its proper divisors (4213478808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2661144432 is a wasteful number, since it uses less digits than its factorization.
2661144432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55440520 (or 55440514 counting only the distinct ones).
The product of its digits is 27648, while the sum is 33.
The square root of 2661144432 is about 51586.2814321792. The cubic root of 2661144432 is about 1385.7646612703.
The spelling of 2661144432 in words is "two billion, six hundred sixty-one million, one hundred forty-four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •