Base | Representation |
---|---|
bin | 100011101101001000100000… |
… | …010000100100110001001010 |
3 | 202121000012222012201011211120 |
4 | 203231020200100210301022 |
5 | 131040312330141222140 |
6 | 1313552005422140110 |
7 | 45035161326102210 |
oct | 4355104020446112 |
9 | 677005865634746 |
10 | 157033135492170 |
11 | 4604341915a283 |
12 | 157420a7421636 |
13 | 6981213030432 |
14 | 2aac631292cb0 |
15 | 1324bd3b621d0 |
hex | 8ed220424c4a |
157033135492170 has 32 divisors (see below), whose sum is σ = 430719457350528. Its totient is φ = 35893288112448.
The previous prime is 157033135492159. The next prime is 157033135492193. The reversal of 157033135492170 is 71294531330751.
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 15 ways as a sum of consecutive naturals, for example, 373888417629 + ... + 373888418048.
It is an arithmetic number, because the mean of its divisors is an integer number (13459983042204).
Almost surely, 2157033135492170 is an apocalyptic number.
157033135492170 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
157033135492170 is an abundant number, since it is smaller than the sum of its proper divisors (273686321858358).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
157033135492170 is a wasteful number, since it uses less digits than its factorization.
157033135492170 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 747776835694.
The product of its (nonzero) digits is 2381400, while the sum is 51.
The spelling of 157033135492170 in words is "one hundred fifty-seven trillion, thirty-three billion, one hundred thirty-five million, four hundred ninety-two thousand, one hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •