Base | Representation |
---|---|
bin | 111101011111011011… |
… | …1010110110001101011 |
3 | 110121211212122001121002 |
4 | 1322332313112301223 |
5 | 4130420101414011 |
6 | 140355151305215 |
7 | 12353231455403 |
oct | 1727667266153 |
9 | 417755561532 |
10 | 132051201131 |
11 | 51003507983 |
12 | 2171381b20b |
13 | c5b5b37c05 |
14 | 6569a91803 |
15 | 367ce8bc3b |
hex | 1ebedd6c6b |
132051201131 has 8 divisors (see below), whose sum is σ = 132719905344. Its totient is φ = 131383260360.
The previous prime is 132051201101. The next prime is 132051201151. The reversal of 132051201131 is 131102150231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132051201131 - 26 = 132051201067 is a prime.
It is a super-2 number, since 2×1320512011312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132051201101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 157556 + ... + 537518.
It is an arithmetic number, because the mean of its divisors is an integer number (16589988168).
Almost surely, 2132051201131 is an apocalyptic number.
132051201131 is a deficient number, since it is larger than the sum of its proper divisors (668704213).
132051201131 is a wasteful number, since it uses less digits than its factorization.
132051201131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 381721.
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 132051201131 its reverse (131102150231), we get a palindrome (263153351362).
The spelling of 132051201131 in words is "one hundred thirty-two billion, fifty-one million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •