Base | Representation |
---|---|
bin | 101101100100111010100… |
… | …010001100001010000001 |
3 | 102002102021101101200021221 |
4 | 231210322202030022001 |
5 | 402303330334400001 |
6 | 10354454344315041 |
7 | 442165130641150 |
oct | 55447242141201 |
9 | 12072241350257 |
10 | 3132013200001 |
11 | aa8308888864 |
12 | 427008a72a81 |
13 | 19946982102a |
14 | ab8398d5597 |
15 | 5670e1c61a1 |
hex | 2d93a88c281 |
3132013200001 has 32 divisors (see below), whose sum is σ = 3715678208000. Its totient is φ = 2583395907840.
The previous prime is 3132013199993. The next prime is 3132013200007. The reversal of 3132013200001 is 1000023102313.
It is a cyclic number.
It is not a de Polignac number, because 3132013200001 - 23 = 3132013199993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3132013200007) 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 31 ways as a sum of consecutive naturals, for example, 75938281 + ... + 75979513.
It is an arithmetic number, because the mean of its divisors is an integer number (116114944000).
Almost surely, 23132013200001 is an apocalyptic number.
3132013200001 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
3132013200001 is a deficient number, since it is larger than the sum of its proper divisors (583665007999).
3132013200001 is a wasteful number, since it uses less digits than its factorization.
3132013200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43229.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 3132013200001 its reverse (1000023102313), we get a palindrome (4132036302314).
The spelling of 3132013200001 in words is "three trillion, one hundred thirty-two billion, thirteen million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •