Base | Representation |
---|---|
bin | 11101001010010011… |
… | …100100001110111000 |
3 | 2222211010221122110102 |
4 | 131022103210032320 |
5 | 1003111210223300 |
6 | 22215000134532 |
7 | 2155632425603 |
oct | 351223441670 |
9 | 88733848412 |
10 | 31311414200 |
11 | 12308527a20 |
12 | 609a167448 |
13 | 2c4cc98531 |
14 | 173069b33a |
15 | c33d210d5 |
hex | 74a4e43b8 |
31311414200 has 96 divisors (see below), whose sum is σ = 80915870160. Its totient is φ = 11171097600.
The previous prime is 31311414151. The next prime is 31311414203. The reversal of 31311414200 is 241411313.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31311414203) 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 23 ways as a sum of consecutive naturals, for example, 17669 + ... + 250868.
Almost surely, 231311414200 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 31311414200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40457935080).
31311414200 is an abundant number, since it is smaller than the sum of its proper divisors (49604455960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31311414200 is a wasteful number, since it uses less digits than its factorization.
31311414200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268617 (or 268608 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 31311414200 its reverse (241411313), we get a palindrome (31552825513).
The spelling of 31311414200 in words is "thirty-one billion, three hundred eleven million, four hundred fourteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •