Base | Representation |
---|---|
bin | 1000010111101… |
… | …01010110111101 |
3 | 11220010002101121 |
4 | 10023311112331 |
5 | 120433223010 |
6 | 10544510541 |
7 | 1511532544 |
oct | 413652675 |
9 | 156102347 |
10 | 70211005 |
11 | 366a5627 |
12 | 1b61b451 |
13 | 11713897 |
14 | 947915b |
15 | 626d3da |
hex | 42f55bd |
70211005 has 4 divisors (see below), whose sum is σ = 84253212. Its totient is φ = 56168800.
The previous prime is 70210991. The next prime is 70211017. The reversal of 70211005 is 50011207.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 50011207 = 3499 ⋅14293.
It can be written as a sum of positive squares in 2 ways, for example, as 24810361 + 45400644 = 4981^2 + 6738^2 .
It is not a de Polignac number, because 70211005 - 215 = 70178237 is a prime.
It is a super-3 number, since 3×702110053 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 70211005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7021096 + ... + 7021105.
It is an arithmetic number, because the mean of its divisors is an integer number (21063303).
Almost surely, 270211005 is an apocalyptic number.
It is an amenable number.
70211005 is a deficient number, since it is larger than the sum of its proper divisors (14042207).
70211005 is a wasteful number, since it uses less digits than its factorization.
70211005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14042206.
The product of its (nonzero) digits is 70, while the sum is 16.
The square root of 70211005 is about 8379.2007375405. The cubic root of 70211005 is about 412.5422154530.
The spelling of 70211005 in words is "seventy million, two hundred eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •