Base | Representation |
---|---|
bin | 1011010000010111010… |
… | …0110001110101010000 |
3 | 200111010101010021222011 |
4 | 2310011310301311100 |
5 | 11132011020000000 |
6 | 224500012552304 |
7 | 16653630335155 |
oct | 2640564616520 |
9 | 614111107864 |
10 | 193371250000 |
11 | 75010036215 |
12 | 31587782694 |
13 | 15308bcc7b6 |
14 | 95059a422c |
15 | 506b5402ba |
hex | 2d05d31d50 |
193371250000 has 240 divisors, whose sum is σ = 485578639728. Its totient is φ = 74592000000.
The previous prime is 193371249989. The next prime is 193371250057. The reversal of 193371250000 is 52173391.
It can be written as a sum of positive squares in 24 ways, for example, as 31825132816 + 161546117184 = 178396^2 + 401928^2 .
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 1711249944 + ... + 1711250056.
Almost surely, 2193371250000 is an apocalyptic number.
193371250000 is a gapful number since it is divisible by the number (10) 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 193371250000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (242789319864).
193371250000 is an abundant number, since it is smaller than the sum of its proper divisors (292207389728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
193371250000 is an frugal number, since it uses more digits than its factorization.
193371250000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230 (or 157 counting only the distinct ones).
The product of its (nonzero) digits is 5670, while the sum is 31.
The spelling of 193371250000 in words is "one hundred ninety-three billion, three hundred seventy-one million, two hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •