Base | Representation |
---|---|
bin | 1000011011011… |
… | …01100001111010 |
3 | 11221001002121000 |
4 | 10031231201322 |
5 | 121100000401 |
6 | 11003225430 |
7 | 1515652566 |
oct | 415554172 |
9 | 157032530 |
10 | 70703226 |
11 | 36a01420 |
12 | 1b818276 |
13 | 11856939 |
14 | 95666a6 |
15 | 6319186 |
hex | 436d87a |
70703226 has 64 divisors (see below), whose sum is σ = 176088960. Its totient is φ = 20839680.
The previous prime is 70703167. The next prime is 70703239. The reversal of 70703226 is 62230707.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 70703226.
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, 20370 + ... + 23586.
It is an arithmetic number, because the mean of its divisors is an integer number (2751390).
Almost surely, 270703226 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 70703226, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (88044480).
70703226 is an abundant number, since it is smaller than the sum of its proper divisors (105385734).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70703226 is a wasteful number, since it uses less digits than its factorization.
70703226 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3276 (or 3270 counting only the distinct ones).
The product of its (nonzero) digits is 3528, while the sum is 27.
The square root of 70703226 is about 8408.5210352356. The cubic root of 70703226 is about 413.5040269382.
It can be divided in two parts, 7070 and 3226, that added together give a triangular number (10296 = T143).
The spelling of 70703226 in words is "seventy million, seven hundred three thousand, two hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •