Base | Representation |
---|---|
bin | 111111100011000… |
… | …1111001000110110 |
3 | 12111121101011100210 |
4 | 1333012033020312 |
5 | 13331334410202 |
6 | 551331250250 |
7 | 103561413330 |
oct | 17706171066 |
9 | 5447334323 |
10 | 2132341302 |
11 | 9a4718643 |
12 | 4b6149986 |
13 | 27ca02720 |
14 | 1632a8450 |
15 | c7304c6c |
hex | 7f18f236 |
2132341302 has 128 divisors (see below), whose sum is σ = 5485132800. Its totient is φ = 537601536.
The previous prime is 2132341283. The next prime is 2132341307. The reversal of 2132341302 is 2031432312.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2132341307) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1191024 + ... + 1192812.
It is an arithmetic number, because the mean of its divisors is an integer number (42852600).
Almost surely, 22132341302 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2132341302, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2742566400).
2132341302 is an abundant number, since it is smaller than the sum of its proper divisors (3352791498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2132341302 is a wasteful number, since it uses less digits than its factorization.
2132341302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1910.
The product of its (nonzero) digits is 864, while the sum is 21.
The square root of 2132341302 is about 46177.2812322250. The cubic root of 2132341302 is about 1287.1196077611.
Adding to 2132341302 its reverse (2031432312), we get a palindrome (4163773614).
The spelling of 2132341302 in words is "two billion, one hundred thirty-two million, three hundred forty-one thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •