Base | Representation |
---|---|
bin | 1110100111011111000011… |
… | …00001110011011101111011 |
3 | 11012210211202121110011121122 |
4 | 13103233201201303131323 |
5 | 13203112403121324011 |
6 | 152210145033055455 |
7 | 6525154046052455 |
oct | 723574141633573 |
9 | 135724677404548 |
10 | 32143024011131 |
11 | a2728640a6330 |
12 | 373164985758b |
13 | 14c20c6c05bb7 |
14 | 7d1a32d212d5 |
15 | 3ab1a92113db |
hex | 1d3be187377b |
32143024011131 has 32 divisors (see below), whose sum is σ = 37218955468800. Its totient is φ = 27451964897280.
The previous prime is 32143024011127. The next prime is 32143024011167. The reversal of 32143024011131 is 13111042034123.
It is not a de Polignac number, because 32143024011131 - 22 = 32143024011127 is a prime.
It is a super-2 number, since 2×321430240111312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 32143024011131.
It is not an unprimeable number, because it can be changed into a prime (32143024014131) 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, 55798805 + ... + 56371913.
It is an arithmetic number, because the mean of its divisors is an integer number (1163092358400).
Almost surely, 232143024011131 is an apocalyptic number.
32143024011131 is a deficient number, since it is larger than the sum of its proper divisors (5075931457669).
32143024011131 is a wasteful number, since it uses less digits than its factorization.
32143024011131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 575379.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 32143024011131 its reverse (13111042034123), we get a palindrome (45254066045254).
The spelling of 32143024011131 in words is "thirty-two trillion, one hundred forty-three billion, twenty-four million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •