Base | Representation |
---|---|
bin | 100011110010000110110110… |
… | …100001010101001101100000 |
3 | 202122012220021110201122000001 |
4 | 203302012312201111031200 |
5 | 131111412403433234210 |
6 | 1314413020311505344 |
7 | 45101652122015566 |
oct | 4362066641251540 |
9 | 678186243648001 |
10 | 157374958883680 |
11 | 4616538859564a |
12 | 157983a3388254 |
13 | 69a7519901685 |
14 | 2ac0dbac07a36 |
15 | 132da3ce3203a |
hex | 8f21b6855360 |
157374958883680 has 24 divisors (see below), whose sum is σ = 371798340363072. Its totient is φ = 62949983553408.
The previous prime is 157374958883651. The next prime is 157374958883693. The reversal of 157374958883680 is 86388859473751.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 157374958883594 and 157374958883603.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 491796746352 + ... + 491796746671.
It is an arithmetic number, because the mean of its divisors is an integer number (15491597515128).
Almost surely, 2157374958883680 is an apocalyptic number.
157374958883680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
157374958883680 is an abundant number, since it is smaller than the sum of its proper divisors (214423381479392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
157374958883680 is an equidigital number, since it uses as much as digits as its factorization.
157374958883680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 983593493038 (or 983593493030 counting only the distinct ones).
The product of its (nonzero) digits is 9754214400, while the sum is 82.
The spelling of 157374958883680 in words is "one hundred fifty-seven trillion, three hundred seventy-four billion, nine hundred fifty-eight million, eight hundred eighty-three thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •