Base | Representation |
---|---|
bin | 1000011010010… |
… | …10100100110000 |
3 | 11220202211012010 |
4 | 10031022210300 |
5 | 121030410143 |
6 | 11000202520 |
7 | 1514515266 |
oct | 415124460 |
9 | 156684163 |
10 | 70560048 |
11 | 36913899 |
12 | 1b769440 |
13 | 11806710 |
14 | 952a436 |
15 | 62dba33 |
hex | 434a930 |
70560048 has 80 divisors (see below), whose sum is σ = 199119200. Its totient is φ = 21399552.
The previous prime is 70560041. The next prime is 70560071. The reversal of 70560048 is 84006507.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 70559997 and 70560024.
It is not an unprimeable number, because it can be changed into a prime (70560041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 44778 + ... + 46326.
It is an arithmetic number, because the mean of its divisors is an integer number (2488990).
Almost surely, 270560048 is an apocalyptic number.
70560048 is a gapful number since it is divisible by the number (78) 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 70560048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (99559600).
70560048 is an abundant number, since it is smaller than the sum of its proper divisors (128559152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70560048 is a wasteful number, since it uses less digits than its factorization.
70560048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1646 (or 1640 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 30.
The square root of 70560048 is about 8400.0028571424. The cubic root of 70560048 is about 413.2247153603.
The spelling of 70560048 in words is "seventy million, five hundred sixty thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •