Base | Representation |
---|---|
bin | 100000101101100111… |
… | …0011110111110000001 |
3 | 20201022211202202202101 |
4 | 1001123032132332001 |
5 | 2122333000002012 |
6 | 52134501150401 |
7 | 5034601102243 |
oct | 1013316367601 |
9 | 221284682671 |
10 | 70250000257 |
11 | 2787a325a58 |
12 | 117466bb401 |
13 | 681718a1b8 |
14 | 3585cd2093 |
15 | 1c62544d57 |
hex | 105b39ef81 |
70250000257 has 8 divisors (see below), whose sum is σ = 71239949352. Its totient is φ = 69265824000.
The previous prime is 70250000239. The next prime is 70250000273. The reversal of 70250000257 is 75200005207.
It can be written as a sum of positive squares in 4 ways, for example, as 22535714161 + 47714286096 = 150119^2 + 218436^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 70250000257 - 27 = 70250000129 is a prime.
It is a super-2 number, since 2×702500002572 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (70250000207) 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 7 ways as a sum of consecutive naturals, for example, 1418698 + ... + 1467379.
It is an arithmetic number, because the mean of its divisors is an integer number (8904993669).
Almost surely, 270250000257 is an apocalyptic number.
It is an amenable number.
70250000257 is a deficient number, since it is larger than the sum of its proper divisors (989949095).
70250000257 is a wasteful number, since it uses less digits than its factorization.
70250000257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2886419.
The product of its (nonzero) digits is 4900, while the sum is 28.
The spelling of 70250000257 in words is "seventy billion, two hundred fifty million, two hundred fifty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •