Base | Representation |
---|---|
bin | 101101100101000001101… |
… | …011101100011011111111 |
3 | 102002102120202001212002222 |
4 | 231211001223230123333 |
5 | 402304102040211111 |
6 | 10354514311035555 |
7 | 442201115230211 |
oct | 55450153543377 |
9 | 12072522055088 |
10 | 3132133132031 |
11 | aa836a553542 |
12 | 42704106bbbb |
13 | 199488623027 |
14 | ab84b7d45b1 |
15 | 567199b67db |
hex | 2d941aec6ff |
3132133132031 has 4 divisors (see below), whose sum is σ = 3132172647552. Its totient is φ = 3132093616512.
The previous prime is 3132133132027. The next prime is 3132133132091. The reversal of 3132133132031 is 1302313312313.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3132133132031 - 22 = 3132133132027 is a prime.
It is a super-5 number, since 5×31321331320315 (a number of 64 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3132133132091) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19638626 + ... + 19797471.
It is an arithmetic number, because the mean of its divisors is an integer number (783043161888).
Almost surely, 23132133132031 is an apocalyptic number.
3132133132031 is a deficient number, since it is larger than the sum of its proper divisors (39515521).
3132133132031 is an equidigital number, since it uses as much as digits as its factorization.
3132133132031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39515520.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 3132133132031 its reverse (1302313312313), we get a palindrome (4434446444344).
The spelling of 3132133132031 in words is "three trillion, one hundred thirty-two billion, one hundred thirty-three million, one hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •