Base | Representation |
---|---|
bin | 111111100010111… |
… | …1000100111110100 |
3 | 12111121012110212000 |
4 | 1333011320213310 |
5 | 13331323432301 |
6 | 551325255300 |
7 | 103560550416 |
oct | 17705704764 |
9 | 5447173760 |
10 | 2132249076 |
11 | 9a4665321 |
12 | 4b6104530 |
13 | 27c99c759 |
14 | 1632829b6 |
15 | c72d7786 |
hex | 7f1789f4 |
2132249076 has 24 divisors (see below), whose sum is σ = 5528053440. Its totient is φ = 710749656.
The previous prime is 2132249057. The next prime is 2132249111. The reversal of 2132249076 is 6709422312.
It is a super-2 number, since 2×21322490762 = 9092972244205707552, which contains 22 as substring.
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 2132249076.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 9871416 + ... + 9871631.
It is an arithmetic number, because the mean of its divisors is an integer number (230335560).
Almost surely, 22132249076 is an apocalyptic number.
It is an amenable number.
2132249076 is an abundant number, since it is smaller than the sum of its proper divisors (3395804364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2132249076 is a wasteful number, since it uses less digits than its factorization.
2132249076 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19743060 (or 19743052 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 36.
The square root of 2132249076 is about 46176.2826134803. The cubic root of 2132249076 is about 1287.1010510687.
The spelling of 2132249076 in words is "two billion, one hundred thirty-two million, two hundred forty-nine thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •