Base | Representation |
---|---|
bin | 10000000100001000111100… |
… | …000101001001011100110100 |
3 | 100021011101022101022000200202 |
4 | 100010020330011021130310 |
5 | 33230040243310022323 |
6 | 410133350255100032 |
7 | 20611345441030400 |
oct | 2004107405113464 |
9 | 307141271260622 |
10 | 70653220001588 |
11 | 2056a953846604 |
12 | 7b11098511618 |
13 | 30567545567c3 |
14 | 13638c3d50100 |
15 | 827cbbc57d28 |
hex | 40423c149734 |
70653220001588 has 36 divisors (see below), whose sum is σ = 143834141856132. Its totient is φ = 30279030888960.
The previous prime is 70653220001587. The next prime is 70653220001677. The reversal of 70653220001588 is 88510002235607.
It can be written as a sum of positive squares in 2 ways, for example, as 16643478848164 + 54009741153424 = 4079642^2 + 7349132^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70653220001587) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 1003718 + ... + 11929538.
It is an arithmetic number, because the mean of its divisors is an integer number (3995392829337).
Almost surely, 270653220001588 is an apocalyptic number.
It is an amenable number.
70653220001588 is an abundant number, since it is smaller than the sum of its proper divisors (73180921854544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70653220001588 is a wasteful number, since it uses less digits than its factorization.
70653220001588 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10958832 (or 10958823 counting only the distinct ones).
The product of its (nonzero) digits is 806400, while the sum is 47.
The spelling of 70653220001588 in words is "seventy trillion, six hundred fifty-three billion, two hundred twenty million, one thousand, five hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •