Base | Representation |
---|---|
bin | 10000000011110000001100… |
… | …110100101101110010101000 |
3 | 100021001211202012000002001212 |
4 | 100003300030310231302220 |
5 | 33224121343241023224 |
6 | 410113234413332252 |
7 | 20606415260225630 |
oct | 2003601464556250 |
9 | 307054665002055 |
10 | 70626657361064 |
11 | 2055a662935632 |
12 | 7b07b04797088 |
13 | 30540b036822c |
14 | 13624c42396c0 |
15 | 827264cb5d0e |
hex | 403c0cd2dca8 |
70626657361064 has 32 divisors (see below), whose sum is σ = 151343324140800. Its totient is φ = 30268470052800.
The previous prime is 70626657361049. The next prime is 70626657361079. The reversal of 70626657361064 is 46016375662607.
It is an interprime number because it is at equal distance from previous prime (70626657361049) and next prime (70626657361079).
It is a junction number, because it is equal to n+sod(n) for n = 70626657360994 and 70626657361012.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 17133122 + ... + 20851790.
It is an arithmetic number, because the mean of its divisors is an integer number (4729478879400).
Almost surely, 270626657361064 is an apocalyptic number.
It is an amenable number.
70626657361064 is an abundant number, since it is smaller than the sum of its proper divisors (80716666779736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70626657361064 is a wasteful number, since it uses less digits than its factorization.
70626657361064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4057833 (or 4057829 counting only the distinct ones).
The product of its (nonzero) digits is 45722880, while the sum is 59.
The spelling of 70626657361064 in words is "seventy trillion, six hundred twenty-six billion, six hundred fifty-seven million, three hundred sixty-one thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.047 sec. • engine limits •