Base | Representation |
---|---|
bin | 100011101110010000010101… |
… | …100111000111000111110000 |
3 | 202121021121001120212020222110 |
4 | 203232100111213013013300 |
5 | 131043043311130341000 |
6 | 1314051243202205320 |
7 | 45043561600606242 |
oct | 4356202547070760 |
9 | 677247046766873 |
10 | 157110266262000 |
11 | 460730a94a3257 |
12 | 15755032353840 |
13 | 69885858a89cc |
14 | 2ab226ad46092 |
15 | 1326bea2bd850 |
hex | 8ee4159c71f0 |
157110266262000 has 80 divisors (see below), whose sum is σ = 506523498448032. Its totient is φ = 41896071001600.
The previous prime is 157110266261911. The next prime is 157110266262011. The reversal of 157110266262000 is 262662011751.
It is a tau number, because it is divible by the number of its divisors (80).
It is a self number, because there is not a number n which added to its sum of digits gives 157110266262000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13092516189 + ... + 13092528188.
Almost surely, 2157110266262000 is an apocalyptic number.
157110266262000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
157110266262000 is an abundant number, since it is smaller than the sum of its proper divisors (349413232186032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
157110266262000 is a wasteful number, since it uses less digits than its factorization.
157110266262000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26185044403 (or 26185044387 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 39.
The spelling of 157110266262000 in words is "one hundred fifty-seven trillion, one hundred ten billion, two hundred sixty-six million, two hundred sixty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •