Base | Representation |
---|---|
bin | 1000011000011… |
… | …00101011010000 |
3 | 11220021221101220 |
4 | 10030030223100 |
5 | 120444302022 |
6 | 10550525040 |
7 | 1512411153 |
oct | 414145320 |
9 | 156257356 |
10 | 70306512 |
11 | 36760361 |
12 | 1b666780 |
13 | 117481b3 |
14 | 94a1c9a |
15 | 628b85c |
hex | 430cad0 |
70306512 has 80 divisors (see below), whose sum is σ = 192701952. Its totient is φ = 22049280.
The previous prime is 70306493. The next prime is 70306531. The reversal of 70306512 is 21560307.
It is an interprime number because it is at equal distance from previous prime (70306493) and next prime (70306531).
It is a super-2 number, since 2×703065122 = 9886011259212288, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54418 + ... + 55694.
Almost surely, 270306512 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 70306512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (96350976).
70306512 is an abundant number, since it is smaller than the sum of its proper divisors (122395440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70306512 is a wasteful number, since it uses less digits than its factorization.
70306512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1356 (or 1350 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 24.
The square root of 70306512 is about 8384.8978526873. The cubic root of 70306512 is about 412.7291890738.
Adding to 70306512 its reverse (21560307), we get a palindrome (91866819).
The spelling of 70306512 in words is "seventy million, three hundred six thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •