Base | Representation |
---|---|
bin | 1001001011011000110… |
… | …0011011010110000100 |
3 | 120001222200100000200111 |
4 | 2102312030123112010 |
5 | 10040404414034300 |
6 | 200233553522404 |
7 | 14251226631346 |
oct | 2226614332604 |
9 | 501880300614 |
10 | 157675533700 |
11 | 60962801233 |
12 | 26685273404 |
13 | 11b3a809489 |
14 | 78bad17296 |
15 | 417c8869ba |
hex | 24b631b584 |
157675533700 has 72 divisors (see below), whose sum is σ = 361185945120. Its totient is φ = 59581209600.
The previous prime is 157675533689. The next prime is 157675533731. The reversal of 157675533700 is 7335576751.
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 23 ways as a sum of consecutive naturals, for example, 553155 + ... + 788245.
It is an arithmetic number, because the mean of its divisors is an integer number (5016471460).
Almost surely, 2157675533700 is an apocalyptic number.
157675533700 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 157675533700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (180592972560).
157675533700 is an abundant number, since it is smaller than the sum of its proper divisors (203510411420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
157675533700 is a wasteful number, since it uses less digits than its factorization.
157675533700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235477 (or 235470 counting only the distinct ones).
The product of its (nonzero) digits is 2315250, while the sum is 49.
The spelling of 157675533700 in words is "one hundred fifty-seven billion, six hundred seventy-five million, five hundred thirty-three thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •