Base | Representation |
---|---|
bin | 111111100010111… |
… | …1000001111000100 |
3 | 12111121012101200100 |
4 | 1333011320033010 |
5 | 13331323404432 |
6 | 551325244100 |
7 | 103560542664 |
oct | 17705701704 |
9 | 5447171610 |
10 | 2132247492 |
11 | 9a4664111 |
12 | 4b6103630 |
13 | 27c99bb0b |
14 | 1632821a4 |
15 | c72d707c |
hex | 7f1783c4 |
2132247492 has 72 divisors (see below), whose sum is σ = 5492148480. Its totient is φ = 697308480.
The previous prime is 2132247473. The next prime is 2132247539. The reversal of 2132247492 is 2947422312.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2104378 + ... + 2105390.
It is an arithmetic number, because the mean of its divisors is an integer number (76279840).
Almost surely, 22132247492 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 2132247492, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2746074240).
2132247492 is an abundant number, since it is smaller than the sum of its proper divisors (3359900988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2132247492 is a wasteful number, since it uses less digits than its factorization.
2132247492 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2073 (or 2068 counting only the distinct ones).
The product of its digits is 48384, while the sum is 36.
The square root of 2132247492 is about 46176.2654618149. The cubic root of 2132247492 is about 1287.1007323492.
The spelling of 2132247492 in words is "two billion, one hundred thirty-two million, two hundred forty-seven thousand, four hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.458 sec. • engine limits •