Base | Representation |
---|---|
bin | 1000011001010… |
… | …01100111010000 |
3 | 11220111221222211 |
4 | 10030221213100 |
5 | 121012100130 |
6 | 10553241504 |
7 | 1513413550 |
oct | 414514720 |
9 | 156457884 |
10 | 70425040 |
11 | 36831414 |
12 | 1b703294 |
13 | 1178a12a |
14 | 94d3160 |
15 | 62b1a2a |
hex | 43299d0 |
70425040 has 80 divisors (see below), whose sum is σ = 190023552. Its totient is φ = 23772672.
The previous prime is 70425031. The next prime is 70425053. The reversal of 70425040 is 4052407.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36582 + ... + 38458.
Almost surely, 270425040 is an apocalyptic number.
70425040 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 70425040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (95011776).
70425040 is an abundant number, since it is smaller than the sum of its proper divisors (119598512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70425040 is a wasteful number, since it uses less digits than its factorization.
70425040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1964 (or 1958 counting only the distinct ones).
The product of its (nonzero) digits is 1120, while the sum is 22.
The square root of 70425040 is about 8391.9628216526. The cubic root of 70425040 is about 412.9609954820.
Adding to 70425040 its reverse (4052407), we get a palindrome (74477447).
The spelling of 70425040 in words is "seventy million, four hundred twenty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •