Base | Representation |
---|---|
bin | 1001001000111010110… |
… | …0001011101011110010 |
3 | 120000021111020010011002 |
4 | 2102032230023223302 |
5 | 10033030232111042 |
6 | 200044120322002 |
7 | 14225631343310 |
oct | 2221654135362 |
9 | 500244203132 |
10 | 157012769522 |
11 | 60652684744 |
12 | 2651b313302 |
13 | 11a6340671b |
14 | 7856cb30b0 |
15 | 413e5bc132 |
hex | 248eb0baf2 |
157012769522 has 64 divisors (see below), whose sum is σ = 286327996416. Its totient is φ = 63037958400.
The previous prime is 157012769521. The next prime is 157012769549. The reversal of 157012769522 is 225967210751.
157012769522 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (157012769521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 84098033 + ... + 84099899.
It is an arithmetic number, because the mean of its divisors is an integer number (4473874944).
Almost surely, 2157012769522 is an apocalyptic number.
157012769522 is a deficient number, since it is larger than the sum of its proper divisors (129315226894).
157012769522 is a wasteful number, since it uses less digits than its factorization.
157012769522 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3351.
The product of its (nonzero) digits is 529200, while the sum is 47.
The spelling of 157012769522 in words is "one hundred fifty-seven billion, twelve million, seven hundred sixty-nine thousand, five hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •