Base | Representation |
---|---|
bin | 111110000010000… |
… | …0001111110110100 |
3 | 12101001120200012200 |
4 | 1330010001332310 |
5 | 13230321301401 |
6 | 542312144500 |
7 | 102402606225 |
oct | 17404017664 |
9 | 5331520180 |
10 | 2081431476 |
11 | 978a06303 |
12 | 4a1098130 |
13 | 2722b9177 |
14 | 15a61524c |
15 | c2aea686 |
hex | 7c101fb4 |
2081431476 has 36 divisors (see below), whose sum is σ = 5360672772. Its totient is φ = 680719104.
The previous prime is 2081431459. The next prime is 2081431487. The reversal of 2081431476 is 6741341802.
It can be written as a sum of positive squares in 2 ways, for example, as 1890162576 + 191268900 = 43476^2 + 13830^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 2081431476.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 543541 + ... + 547356.
It is an arithmetic number, because the mean of its divisors is an integer number (148907577).
Almost surely, 22081431476 is an apocalyptic number.
It is an amenable number.
2081431476 is an abundant number, since it is smaller than the sum of its proper divisors (3279241296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2081431476 is a wasteful number, since it uses less digits than its factorization.
2081431476 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1090960 (or 1090955 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The square root of 2081431476 is about 45622.7078985893. The cubic root of 2081431476 is about 1276.7936260093.
The spelling of 2081431476 in words is "two billion, eighty-one million, four hundred thirty-one thousand, four hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •