Search a number
-
+
395040010092000 = 253537133156920509
BaseRepresentation
bin101100111010010010110101…
…1011110010011110111100000
31220210201110022112012020211220
41121310211223132103313200
5403234313420040421000
63520102513021335040
7146131461500222550
oct13164455336236740
91823643275166756
10395040010092000
11104965589030479
1238381498107480
1313c57161660750
146d7a077939160
1530a0d6d2391a0
hex167496b793de0

395040010092000 has 1536 divisors, whose sum is σ = 1647151917465600. Its totient is φ = 80514736128000.

The previous prime is 395040010091897. The next prime is 395040010092029. The reversal of 395040010092000 is 290010040593.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 19261777746 + ... + 19261798254.

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

Almost surely, 2395040010092000 is an apocalyptic number.

395040010092000 is a gapful number since it is divisible by the number (30) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 395040010092000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (823575958732800).

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

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

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

395040010092000 is an odious number, because the sum of its binary digits is odd.

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

The product of its (nonzero) digits is 9720, while the sum is 33.

The spelling of 395040010092000 in words is "three hundred ninety-five trillion, forty billion, ten million, ninety-two thousand".