Base | Representation |
---|---|
bin | 111111100010110… |
… | …0010111010000011 |
3 | 12111121000221211202 |
4 | 1333011202322003 |
5 | 13331313111011 |
6 | 551323331415 |
7 | 103560030203 |
oct | 17705427203 |
9 | 5447027752 |
10 | 2132160131 |
11 | 9a4604512 |
12 | 4b6080b6b |
13 | 27c96b11a |
14 | 16325c403 |
15 | c72bb23b |
hex | 7f162e83 |
2132160131 has 8 divisors (see below), whose sum is σ = 2151053520. Its totient is φ = 2113337952.
The previous prime is 2132160119. The next prime is 2132160139. The reversal of 2132160131 is 1310612312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2132160131 is a prime.
It is a super-2 number, since 2×21321601312 = 9092213648451874322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2132160139) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 43265 + ... + 78333.
It is an arithmetic number, because the mean of its divisors is an integer number (268881690).
Almost surely, 22132160131 is an apocalyptic number.
2132160131 is a deficient number, since it is larger than the sum of its proper divisors (18893389).
2132160131 is a wasteful number, since it uses less digits than its factorization.
2132160131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35605.
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 2132160131 is about 46175.3195007896. The cubic root of 2132160131 is about 1287.0831540360.
Adding to 2132160131 its reverse (1310612312), we get a palindrome (3442772443).
The spelling of 2132160131 in words is "two billion, one hundred thirty-two million, one hundred sixty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •