Base | Representation |
---|---|
bin | 11100111001101010… |
… | …001110110100100110 |
3 | 2222002200110012120220 |
4 | 130321222032310212 |
5 | 1002023212040032 |
6 | 22131142305210 |
7 | 2146001602350 |
oct | 347152166446 |
9 | 88080405526 |
10 | 31032143142 |
11 | 121849214a0 |
12 | 6020728206 |
13 | 2c071778a0 |
14 | 17055620d0 |
15 | c1955912c |
hex | 739a8ed26 |
31032143142 has 128 divisors (see below), whose sum is σ = 84157774848. Its totient is φ = 7366464000.
The previous prime is 31032143141. The next prime is 31032143147. The reversal of 31032143142 is 24134123013.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31032143141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 581028 + ... + 632184.
It is an arithmetic number, because the mean of its divisors is an integer number (657482616).
Almost surely, 231032143142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 31032143142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42078887424).
31032143142 is an abundant number, since it is smaller than the sum of its proper divisors (53125631706).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31032143142 is a wasteful number, since it uses less digits than its factorization.
31032143142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51294.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 31032143142 its reverse (24134123013), we get a palindrome (55166266155).
The spelling of 31032143142 in words is "thirty-one billion, thirty-two million, one hundred forty-three thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •