Base | Representation |
---|---|
bin | 111111100010011… |
… | …1110010011110111 |
3 | 12111120202100012220 |
4 | 1333010332103313 |
5 | 13331243311411 |
6 | 551320213423 |
7 | 103555534161 |
oct | 17704762367 |
9 | 5446670186 |
10 | 2132010231 |
11 | 9a451192a |
12 | 4b600a273 |
13 | 27c917b20 |
14 | 16321d931 |
15 | c728bb06 |
hex | 7f13e4f7 |
2132010231 has 32 divisors (see below), whose sum is σ = 3215009280. Its totient is φ = 1246886784.
The previous prime is 2132010227. The next prime is 2132010259. The reversal of 2132010231 is 1320102312.
It is not a de Polignac number, because 2132010231 - 22 = 2132010227 is a prime.
It is a super-2 number, since 2×21320102312 = 9090935250177346722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2132010231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2132010281) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 133260 + ... + 148398.
It is an arithmetic number, because the mean of its divisors is an integer number (100469040).
Almost surely, 22132010231 is an apocalyptic number.
2132010231 is a deficient number, since it is larger than the sum of its proper divisors (1082999049).
2132010231 is a wasteful number, since it uses less digits than its factorization.
2132010231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15335.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 2132010231 is about 46173.6963107785. The cubic root of 2132010231 is about 1287.0529908408.
Adding to 2132010231 its reverse (1320102312), we get a palindrome (3452112543).
It can be divided in two parts, 2 and 132010231, that multiplied together give a palindrome (264020462).
The spelling of 2132010231 in words is "two billion, one hundred thirty-two million, ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •