Base | Representation |
---|---|
bin | 1000011101000… |
… | …11001100110100 |
3 | 11221110021011000 |
4 | 10032203030310 |
5 | 121124014220 |
6 | 11012043300 |
7 | 1520556525 |
oct | 416431464 |
9 | 157407130 |
10 | 70923060 |
11 | 370415aa |
12 | 1b903530 |
13 | 11902a10 |
14 | 95c284c |
15 | 635e390 |
hex | 43a3334 |
70923060 has 96 divisors (see below), whose sum is σ = 237646080. Its totient is φ = 17456256.
The previous prime is 70923059. The next prime is 70923079. The reversal of 70923060 is 6032907.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1969 + ... + 12071.
It is an arithmetic number, because the mean of its divisors is an integer number (2475480).
Almost surely, 270923060 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 70923060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (118823040).
70923060 is an abundant number, since it is smaller than the sum of its proper divisors (166723020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70923060 is a wasteful number, since it uses less digits than its factorization.
70923060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10134 (or 10126 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 27.
The square root of 70923060 is about 8421.5829865887. The cubic root of 70923060 is about 413.9321459893.
Adding to 70923060 its reverse (6032907), we get a palindrome (76955967).
The spelling of 70923060 in words is "seventy million, nine hundred twenty-three thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •