Search a number
-
+
31405052000 = 255371723881
BaseRepresentation
bin11101001111111000…
…110001000001100000
310000001200010221101002
4131033320301001200
51003304143131000
622232143131132
72161150352240
oct351770610140
9100050127332
1031405052000
1112356373433
1261055a3aa8
132c664c220a
14173ccb3b20
15c3c16a8d5
hex74fe31060

31405052000 has 288 divisors, whose sum is σ = 93702038976. Its totient is φ = 10131456000.

The previous prime is 31405051991. The next prime is 31405052033. The reversal of 31405052000 is 25050413.

It is a super-2 number, since 2×314050520002 (a number of 22 digits) contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (20).

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 8090060 + ... + 8093940.

It is an arithmetic number, because the mean of its divisors is an integer number (325354302).

Almost surely, 231405052000 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 31405052000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46851019488).

31405052000 is an abundant number, since it is smaller than the sum of its proper divisors (62296986976).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

31405052000 is a wasteful number, since it uses less digits than its factorization.

31405052000 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 3947 (or 3912 counting only the distinct ones).

The product of its (nonzero) digits is 600, while the sum is 20.

The spelling of 31405052000 in words is "thirty-one billion, four hundred five million, fifty-two thousand".